Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Quadratic assignment problem (view), Generalized assignment problem (view), Weapon target assignment problem (view), Quadratic bottleneck assignment problem (view), Linear bottleneck assignment problem (view), Multidimensional assignment problem (view)

searching for Assignment problem 58 found (124 total)

alternate case: assignment problem

Reinforcement learning (8,193 words) [view diff] no match in snippet view article find links to article

Reinforcement learning (RL) is an interdisciplinary area of machine learning and optimal control concerned with how an intelligent agent should take actions

David Shmoys (1,787 words) [view diff] exact match in snippet view article find links to article

including the k-center and k-median problems and the generalized assignment problem. Polynomial-time approximation schemes that he developed for scheduling

Activity selection problem (1,172 words) [view diff] no match in snippet view article find links to article

The activity selection problem is a combinatorial optimization problem concerning the selection of non-conflicting activities to perform within a given

Proto-value function (1,082 words) [view diff] exact match in snippet view article find links to article

transition matrices. They provide a novel framework for solving the credit assignment problem. The framework introduces a novel approach to solving Markov decision

Route assignment (2,692 words) [view diff] case mismatch in snippet view article find links to article

Operations Research has a page on the topic of: Transportation and Assignment Problem The problem of estimating how many users are on each route is long

Fair random assignment (2,211 words) [view diff] exact match in snippet view article find links to article

probabilistic one-sided matching) is a kind of a fair division problem. In an assignment problem (also called house-allocation problem or one-sided matching), there

L(h, k)-coloring (243 words) [view diff] exact match in snippet view article

to be non-negative integers. The problem originated from a channel assignment problem in radio networks. The span of an L(h, k)-labelling, ρh,k(G) is the

Coase theorem (6,099 words) [view diff] exact match in snippet view article find links to article

Coase Theorem to real-world situations. The first is known as the assignment problem, and stems from the fact that for most situations with externalities

Hervé Moulin (1,582 words) [view diff] exact match in snippet view article find links to article

the probabilistic-serial procedure as a solution to the fair random assignment problem, which consists of dividing several goods among a number of persons

Simultaneous eating algorithm (2,902 words) [view diff] exact match in snippet view article find links to article

Hervé Moulin and Anna Bogomolnaia as a solution for the fair random assignment problem, where the fraction that each agent receives of each item is interpreted

Fair item allocation (6,587 words) [view diff] exact match in snippet view article find links to article

items.: 285 But such solutions are not always available. An item assignment problem has several ingredients: The partners have to express their preferences

T-coloring (691 words) [view diff] case mismatch in snippet view article find links to article

Cozzens and F. S. Roberts, T -colorings of graphs and the Channel Assignment Problem. Congr. Numer. 35 (1982) 191–208. Chartrand, Gary; Zhang, Ping (2009)

Kalmanson combinatorial conditions (192 words) [view diff] case mismatch in snippet view article find links to article

1016/j.dam.2003.08.005, MR 2049654. Çela, Eranda (1998), The Quadratic Assignment Problem: Theory and Algorithms, Combinatorial Optimization, vol. 1, Dordrecht:

Frank–Wolfe algorithm (1,200 words) [view diff] exact match in snippet view article find links to article

(1984). "A modified Frank-Wolfe algorithm for solving the traffic assignment problem". Transportation Research Part B: Methodological. 18 (2): 169–177

Truthful resource allocation (1,711 words) [view diff] case mismatch in snippet view article find links to article

Bogomolnaia, Anna; Moulin, Hervé (2001). "A New Solution to the Random Assignment Problem". Journal of Economic Theory. 100 (2): 295. doi:10.1006/jeth.2000

Program comprehension (188 words) [view diff] exact match in snippet view article find links to article

theory of program comprehension in software engineering The concept assignment problem in program understanding, and Program Comprehension During Software

Random priority item allocation (952 words) [view diff] exact match in snippet view article find links to article

yields an ex-post Pareto efficient (PE) outcome. Moreover, in an assignment problem, every deterministic PE assignment is the outcome of SD for some ordering

Cyrus Derman (971 words) [view diff] case mismatch in snippet view article find links to article

in "Management Science", Vol. 19(4), 1972. A Sequential Stochastic Assignment Problem with G.J. Lieberman and S.M. Ross, "Management Science", Vol. 18(7)

Decisive Analytics Corporation (907 words) [view diff] exact match in snippet view article find links to article

Retrieved 2011-06-24. D Fanjoy, D Pederson. Solving variations of the assignment problem with a genetic algorithm. Military Operations Research Society Symposium

Generalized second-price auction (1,539 words) [view diff] exact match in snippet view article find links to article

auction model is discussed in Ashlagi et al. and in the more general assignment problem by Aggarwal et al. and Dütting et al. Vickrey–Clarke–Groves auction

Edmonds' algorithm (1,328 words) [view diff] exact match in snippet view article find links to article

algorithm for finding minimum spanning forests that solves the root assignment problem is presented in (https://link.springer.com/article/10.1007/s10958-023-06666-w)

Antoon Kolen (478 words) [view diff] exact match in snippet view article find links to article

binary constraint satisfaction problem: an application to a frequency assignment problem." Statistica Neerlandica 61.1 (2007): 4-15. Barnhart, Cynthia, et

Ordinal Pareto efficiency (3,044 words) [view diff] exact match in snippet view article find links to article

true. McLennan proves that they are equivalent in the fair random assignment problem (with strict or weak item rankings). Particularly, he proves that

Philip Newcomb (340 words) [view diff] exact match in snippet view article find links to article

Mitbander, and Dallas E. Webster. "Program understanding and the concept assignment problem." Communications of the ACM 37.5 (1994): 72-82. Anquetil, Nicolas

Race condition (4,513 words) [view diff] case mismatch in snippet view article find links to article

the Wayback Machine Paper "A Novel Framework for Solving the State Assignment Problem for Event-Based Specifications" by Luciano Lavagno, Cho W. Moon, Robert

Racetrack problem (219 words) [view diff] case mismatch in snippet view article find links to article

and Steven M. Nowick Paper "A Novel Framework for Solving the State Assignment Problem for Event-Based Specifications" by Luciano Lavagno, Cho W. Moon, Robert

Berth allocation problem (2,196 words) [view diff] case mismatch in snippet view article find links to article

Ropke, S., Larsen, A., Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results. Transportation

Course allocation (2,935 words) [view diff] case mismatch in snippet view article find links to article

15. Budish, Eric; Cantillon, Estelle (2012-08-01). "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard". American

Jacob Rubinovitz (608 words) [view diff] exact match in snippet view article find links to article

robotic assembly line balancing Genetic algorithm for linear and cyclic assignment problem Using learning theory in assembly lines for new products A weighted

Approximate Competitive Equilibrium from Equal Incomes (1,050 words) [view diff] case mismatch in snippet view article find links to article

people. Combinatorial auction Budish, Eric (2011). "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes". Journal

Birkhoff algorithm (1,507 words) [view diff] exact match in snippet view article find links to article

2n + 2 permutation matrices may be required). In the fair random assignment problem, there are n objects and n people with different preferences over

Ailsa Land (1,388 words) [view diff] exact match in snippet view article find links to article

resulting in contributions to data envelopment analysis, the quadratic assignment problem, and combinatorial auctions. In addition to her methodological work

Ménage problem (2,045 words) [view diff] exact match in snippet view article find links to article

Assignment problem in combinatorial mathematics

Robert Kass (1,162 words) [view diff] exact match in snippet view article find links to article

brain-computer interface, and the brain's apparent ability to solve the credit assignment problem during brain-controlled robotic movement. Kass's book Analysis of

Assembly line feeding problem (902 words) [view diff] exact match in snippet view article find links to article

quantitative aspects and use mathematical optimization to solve this assignment problem to optimality minimize: C = ∑ i ∈ I ∑ s ∈ S ∑ p ∈ P χ i s p ⋅ c i

Value-added tax (9,406 words) [view diff] case mismatch in snippet view article find links to article

Policy, 23: 375–411. McLure, Charles E. (1993) "The Brazilian Tax Assignment Problem: Ends, Means, and Constraints", in A Reforma Fiscal no Brasil (São

Parent–teacher conference (2,731 words) [view diff] exact match in snippet view article find links to article

there exists a simple polynomial transformation of the class-teacher assignment problem with teacher availability constraints (CTTA) in school timetable construction

Matroid intersection (1,822 words) [view diff] exact match in snippet view article find links to article

one on Y with bases BY and valuation vY, the valuated independent assignment problem is the problem of finding a matching M in G, such that MX (the subset

Responsive set extension (1,664 words) [view diff] exact match in snippet view article find links to article

Akshay-Kumar; Sethuraman, Jay (2006). "A solution to the random assignment problem on the full preference domain". Journal of Economic Theory. 131 (1):

Franco P. Preparata (852 words) [view diff] case mismatch in snippet view article find links to article

Preparata, Franco P.; Metze, G.; Chien, R. T. (1967). "On the Connection Assignment Problem of Diagnosable Systems". IEEE Transactions on Electronic Computers

Ravindra K. Ahuja (1,546 words) [view diff] case mismatch in snippet view article find links to article

Research, INFORMS, “Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem” 2007: Finalist for the Innovations in Curriculum Award for his role

Belief propagation (4,323 words) [view diff] exact match in snippet view article find links to article

solution of the marginalization problem is equivalent to the MAP assignment problem: argmax x P ( x ) = 1 Z exp ⁡ ( − 1 2 x T A x + b T x ) . {\displaystyle

Assignment valuation (439 words) [view diff] exact match in snippet view article find links to article

Shapley, Lloyd S. (1962). "Complements and substitutes in the opttmal assignment problem". Naval Research Logistics Quarterly. 9 (1): 45–48. doi:10.1002/nav

Robert Tienwen Chien (629 words) [view diff] case mismatch in snippet view article find links to article

Franco P.; Metze, Gernot; Chien, Robert T. (1967). "On the Connection Assignment Problem of Diagnosable Systems". IEEE Transactions on Electronic Computers

Behnam Malakooti (795 words) [view diff] exact match in snippet view article find links to article

G. I. D'souza. "Multiple objective programming for the quadratic assignment problem." International Journal of Production Research 25.2 (1987): 285-300

Upward planar drawing (2,328 words) [view diff] exact match in snippet view article find links to article

checking that the embedding is bimodal and modeling the consistent assignment problem as a network flow problem. The running time is linear in the size

Signal transition graphs (3,884 words) [view diff] exact match in snippet view article find links to article

Brayton, R.K.; Sangiovanni-Vincentelli, A. (1992). "Solving the state assignment problem for signal transition graphs". [1992] Proceedings 29th ACM/IEEE Design

List of unsolved problems in fair division (3,593 words) [view diff] case mismatch in snippet view article find links to article

11.059. S2CID 170079201. Budish, Eric (2011). "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes". Journal

Envy-free item allocation (3,729 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-1-57735-770-4. Budish, Eric (2011). "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes". Journal

Matroid oracle (4,287 words) [view diff] exact match in snippet view article find links to article

(1995), "An efficient cost scaling algorithm for the independent assignment problem", Journal of the Operations Research Society of Japan, 38 (1): 124–136

Table of metaheuristics (3,875 words) [view diff] exact match in snippet view article find links to article

Optimization: A new metaheuristic approach and its performance on quadratic assignment problem". Information Sciences. 217: 65–77. doi:10.1016/j.ins.2012.06.032

Feedback arc set (6,130 words) [view diff] exact match in snippet view article find links to article

Frieze, Alan; Kaplan, Haim (2002), "A new rounding procedure for the assignment problem with applications to dense graph arrangement problems", Mathematical

Fisher market (2,899 words) [view diff] case mismatch in snippet view article find links to article

ISBN 9783319231136. Budish, Eric (2011). "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes". Journal

Cutwidth (2,377 words) [view diff] exact match in snippet view article find links to article

Frieze, Alan; Kaplan, Haim (2002). "A new rounding procedure for the assignment problem with applications to dense graph arrangement problems". Mathematical

Danny Raz (1,029 words) [view diff] case mismatch in snippet view article find links to article

(30 November 2006). "An efficient approximation for the Generalized Assignment Problem". Information Processing Letters. 100 (4): 162–166. doi:10.1016/j

Guoqiang Tian (1,921 words) [view diff] case mismatch in snippet view article find links to article

Size Ratio of Ordinally Efficient and Envy-free Mechanisms in the Assignment Problem. Games and Economic Behavior, 105, 1–8. "Guoqiang Tian". "Message

Efficient approximately fair item allocation (5,471 words) [view diff] case mismatch in snippet view article find links to article

988792. ISBN 1-58113-771-0. Budish, Eric (2011). "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes". Journal

Maximin share (11,200 words) [view diff] case mismatch in snippet view article find links to article

ISSN 0091-1798. JSTOR 2244076. Budish, Eric (2011). "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes". Journal