Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: European Chapter on Combinatorial Optimization (view)

searching for Combinatorial optimization 264 found (584 total)

alternate case: combinatorial optimization

Relaxation (approximation) (739 words) [view diff] exact match in snippet view article

solutions. A Lagrangian relaxation of a complicated problem in combinatorial optimization penalizes violations of some constraints, allowing an easier relaxed

Dan Gusfield (1,622 words) [view diff] exact match in snippet view article find links to article

University of California, Davis. Gusfield is known for his research in combinatorial optimization and computational biology. Gusfield received his undergraduate

Naveen Garg (484 words) [view diff] exact match in snippet view article find links to article

the design and analysis of approximation algorithms for NP-hard combinatorial optimization problems arising in network design, scheduling, routing, facility

PSPACE-complete (1,564 words) [view diff] exact match in snippet view article find links to article

quantified Boolean formulas, step-by-step changes between solutions of combinatorial optimization problems, and many puzzles and games. A problem is defined to

Clifford Stein (405 words) [view diff] exact match in snippet view article find links to article

research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm

Möbius ladder (1,383 words) [view diff] case mismatch in snippet view article find links to article

relaxations for the linear ordering problem". Integer Programming and Combinatorial Optimization: 8th International IPCO Conference, Utrecht, The Netherlands,

Concorde TSP Solver (436 words) [view diff] exact match in snippet view article find links to article

for seismic surveys, and in studying the scaling properties of combinatorial optimization problems. According to Mulder & Wunsch (2003), Concorde “is widely

LEMON (C++ library) (255 words) [view diff] exact match in snippet view article

implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and networks. The library is

Pascal Van Hentenryck (759 words) [view diff] case mismatch in snippet view article find links to article

has also published several books, including Online Stochastic Combinatorial Optimization, Hybrid Optimization, and Constraint-Based Local Search. Van Hentenryck

Strong NP-completeness (642 words) [view diff] exact match in snippet view article find links to article

strongly NP-complete problem has a polynomial reduction to it; in combinatorial optimization, particularly, the phrase "strongly NP-hard" is reserved for problems

Samir Khuller (392 words) [view diff] exact match in snippet view article find links to article

research is in the area of algorithm design, specifically on combinatorial optimization, graphs and networks and scheduling. Khuller obtained his undergraduate

Arborescence (graph theory) (782 words) [view diff] case mismatch in snippet view article

p. 747. ISBN 978-0-07-338309-5. Alexander Schrijver (2003). Combinatorial Optimization: Polyhedra and Efficiency. Springer. p. 34. ISBN 3-540-44389-4

Algorithms and Combinatorics (529 words) [view diff] case mismatch in snippet view article find links to article

(Karl Heinz Borgwardt, 1987, vol. 1) Geometric Algorithms and Combinatorial Optimization (Martin Grötschel, László Lovász, and Alexander Schrijver, 1988

Gérard Cornuéjols (423 words) [view diff] case mismatch in snippet view article find links to article

Congress of Mathematicians in 2002. Cornuéjols is the author of: Combinatorial Optimization: Packing and Covering (Society for Industrial and Applied Mathematics

Duality (optimization) (3,900 words) [view diff] exact match in snippet view article

relaxation". In Jünger, Michael; Naddef, Denis (eds.). Computational combinatorial optimization: Papers from the Spring School held in Schloß Dagstuhl, May 15–19

Capacitated arc routing problem (277 words) [view diff] exact match in snippet view article find links to article

CARP is NP-hard arc routing problem. The CARP can be solved with combinatorial optimization including convex hulls. The large-scale capacitated arc routing

List of optimization software (1,269 words) [view diff] exact match in snippet view article find links to article

equalities or inequalities that the members of A have to satisfy. In combinatorial optimization, A is some subset of a discrete space, like binary strings, permutations

Smoothed analysis (1,727 words) [view diff] no match in snippet view article find links to article

In theoretical computer science, smoothed analysis is a way of measuring the complexity of an algorithm. Since its introduction in 2001, smoothed analysis

Dieter Jungnickel (414 words) [view diff] exact match in snippet view article find links to article

it a "first class textbook" and indispensable for teachers of combinatorial optimization. The second edition appeared in 2005, the third in 2008, and the

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

in Kalmanson matrices and in circulant matrices", Journal of Combinatorial Optimization, 3 (1): 51–58, doi:10.1023/A:1009881510868, MR 1702465. Deĭneko

Quadratic unconstrained binary optimization (2,635 words) [view diff] exact match in snippet view article find links to article

known as unconstrained binary quadratic programming (UBQP), is a combinatorial optimization problem with a wide range of applications from finance and economics

Geometry of numbers (1,054 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

EvoStar (6,343 words) [view diff] case mismatch in snippet view article find links to article

Invited speakers were José Antonio Lozano (talk on The Essence of Combinatorial Optimization Problems, video available on) and Roberto Serra (Dynamically Critical

Xiaohua Jia (164 words) [view diff] case mismatch in snippet view article find links to article

(2006-2009), Wireless Networks, Journal of World Wide Web, Journal of Combinatorial Optimization, etc. He is the General Chair of ACM MobiHoc 2008, TPC Co-Chair

Combinatorics and dynamical systems (541 words) [view diff] exact match in snippet view article find links to article

(1998), "Dynamical system approaches to combinatorial optimization", Handbook of combinatorial optimization, Vol. 2, Boston, MA: Kluwer Acad. Publ.,

3-dimensional matching (1,550 words) [view diff] case mismatch in snippet view article find links to article

problem SP1 in Appendix A.3.1. Korte, Bernhard; Vygen, Jens (2006), Combinatorial Optimization: Theory and Algorithms (3rd ed.), Springer, Section 15.5. Papadimitriou

John von Neumann Theory Prize (637 words) [view diff] exact match in snippet view article find links to article

research and management science, most notably in linear programming, combinatorial optimization, and algorithmic game theory. 2013 Michel Balinski 2012 George

George Nemhauser (656 words) [view diff] case mismatch in snippet view article find links to article

Programming (with Robert Garfinkel, Wiley, 1972, MR0381688) Integer and Combinatorial Optimization (with Laurence A. Wolsey, Wiley, 1988, MR0948455). Optimization

Pre-topological order (123 words) [view diff] case mismatch in snippet view article find links to article

ordering gives a partial order. Schrijver, Alexander (2002-12-10). Combinatorial Optimization: Polyhedra and Efficiency. Springer Science & Business Media.

Auction algorithm (802 words) [view diff] exact match in snippet view article find links to article

The term "auction algorithm" applies to several variations of a combinatorial optimization algorithm which solves assignment problems, and network optimization

EURO Advanced Tutorials in Operational Research (842 words) [view diff] case mismatch in snippet view article find links to article

Rietz, J. - Dual-Feasible Functions for Integer Programming and Combinatorial Optimization Henggeler Antunes, Carlos, João Alves, Maria, Clímaco, João -

Superadditivity (776 words) [view diff] exact match in snippet view article find links to article

combinatorial optimization. SIAM, Philadelphia. ISBN 0-89871-380-3. Michael J. Steele (2011). CBMS Lectures on Probability Theory and Combinatorial Optimization

Edge dominating set (673 words) [view diff] case mismatch in snippet view article find links to article

Alberto; Protasi, Marco (2003), Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer. Minimum

Alan J. Hoffman (3,693 words) [view diff] exact match in snippet view article find links to article

its Applications, and held several patents. He contributed to combinatorial optimization and the eigenvalue theory of graphs. Hoffman and Robert Singleton

Bland's rule (660 words) [view diff] case mismatch in snippet view article find links to article

(1977). Christos H. Papadimitriou, Kenneth Steiglitz (1998-01-29). Combinatorial Optimization: Algorithms and Complexity. Dover Publications. pp. 53–55. ISBN 9780486402581

Hardness of approximation (340 words) [view diff] case mismatch in snippet view article find links to article

MR 0408313. Trevisan, Luca (July 27, 2004), Inapproximability of Combinatorial Optimization Problems (PDF), arXiv:cs/0409043, Bibcode:2004cs........9043T

Tucker Prize (440 words) [view diff] case mismatch in snippet view article find links to article

and Dion Gijswijt 2009: Mohit Singh for "Iterative Methods in Combinatorial Optimization". Other Finalists: Tobias Achterberg and Jiawang Nie 2012: Oliver

Lovász number (2,120 words) [view diff] exact match in snippet view article find links to article

Alexander (1981), "The ellipsoid method and its consequences in combinatorial optimization" (PDF), Combinatorica, 1 (2): 169–197, doi:10.1007/BF02579273

Jonathan Kuck (854 words) [view diff] exact match in snippet view article find links to article

- advised by Stefano Ermon. Kuck's research interests include combinatorial optimization, approximate probabilistic inference, combining probabilistic

Zadeh's rule (515 words) [view diff] case mismatch in snippet view article find links to article

the 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO). pp. 192–206. Disser, Y.; Hopp, A.V. (2019). "On Friedmann's

Adversarial queueing network (198 words) [view diff] case mismatch in snippet view article find links to article

Adversarial Queueing Networks". Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (PDF). Lecture Notes in Computer Science

Partition matroid (965 words) [view diff] case mismatch in snippet view article find links to article

North-Holland, pp. 1169–1179, MR 0389630. Lawler, Eugene L. (1976), Combinatorial Optimization: Networks and Matroids, Rinehart and Winston, New York: Holt,

Philippe Baptiste (4,439 words) [view diff] exact match in snippet view article find links to article

scientific publications and communications in the field of algorithms, combinatorial optimization, operational research and artificial intelligence. Baptiste was

Polymatroid (1,258 words) [view diff] case mismatch in snippet view article find links to article

and Breach, New York. MR0270945 Schrijver, Alexander (2003), Combinatorial Optimization, Springer, §44, p. 767, ISBN 3-540-44389-4 Welsh, D.J.A. (1976)

Sum coloring (536 words) [view diff] exact match in snippet view article find links to article

tasks and interval graphs", Approximation, randomization, and combinatorial optimization (Berkeley, CA, 2001), Lecture Notes in Computer Science, vol. 2129

Self-play (504 words) [view diff] case mismatch in snippet view article find links to article

Laterre, Alexandre (2018). "Ranked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization". arXiv:1712.01815 [cs.AI]. v t e

J. Michael Steele (259 words) [view diff] exact match in snippet view article find links to article

ISBN 978-1-4419-2862-7. Steele, J. Michael (1997). Probability theory and combinatorial optimization. Philadelphia. ISBN 0-89871-380-3. OCLC 35331384.{{cite book}}:

K-vertex-connected graph (772 words) [view diff] case mismatch in snippet view article find links to article

Tutte embedding Vertex separator Schrijver (12 February 2003), Combinatorial Optimization, Springer, ISBN 9783540443896 Beineke, Lowell W.; Bagga, Jay S

Tree (graph theory) (3,383 words) [view diff] case mismatch in snippet view article

116. ISBN 978-1-4398-8018-0. Bernhard Korte; Jens Vygen (2012). Combinatorial Optimization: Theory and Algorithms (5th ed.). Springer Science & Business

NP-hardness (1,119 words) [view diff] case mismatch in snippet view article find links to article

B. (1985), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, ISBN 0-471-90413-9. More precisely, this language

Knight's tour (2,319 words) [view diff] exact match in snippet view article find links to article

449–450, ISBN 9781118659502, The knight's tour problem is a classic combinatorial optimization problem. ... The cardinality Nx of x (the size of the search space)

Loss functions for classification (4,206 words) [view diff] exact match in snippet view article find links to article

non-smooth, and solving for the optimal solution is an NP-hard combinatorial optimization problem. As a result, it is better to substitute loss function

Dimitris Bertsimas (320 words) [view diff] case mismatch in snippet view article find links to article

Institutions Massachusetts Institute of Technology Thesis Probabilistic Combinatorial Optimization Problems (1988) Doctoral advisor Daniel J. Kleitman Amedeo Rodolfo

Majority function (680 words) [view diff] case mismatch in snippet view article find links to article

for the Majority Function". Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science

In Pursuit of the Traveling Salesman (1,061 words) [view diff] exact match in snippet view article find links to article

sparked the development of "many of the concepts and techniques of combinatorial optimization". The introductory chapter of the book explores the limits of

MKP (230 words) [view diff] exact match in snippet view article find links to article

setting cement. Multidimensional knapsack problem, a problem in combinatorial optimization Kilopondmetre, a unit of torque MKP is used to refer to Starcraft

Mathematical Optimization Society (396 words) [view diff] case mismatch in snippet view article find links to article

fields of mathematical programming. The Integer Programming and Combinatorial Optimization (IPCO) conference, in integer programming, is held in those years

Minimum cut (732 words) [view diff] exact match in snippet view article find links to article

{\displaystyle k=3} . Graph partition problems are a family of combinatorial optimization problems in which a graph is to be partitioned into two or more

Adjacent-vertex-distinguishing-total coloring (777 words) [view diff] case mismatch in snippet view article find links to article

distinguishing total colorings of outerplanar graphs". Journal of Combinatorial Optimization. 19 (2): 123–133. doi:10.1007/s10878-008-9165-x. S2CID 30532745

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

1997, Theorem 1.9.2. Michael J. Steele. "Probability theory and combinatorial optimization". SIAM, Philadelphia (1997). ISBN 0-89871-380-3. Michael J. Steele

Longest path problem (2,662 words) [view diff] case mismatch in snippet view article find links to article

lengths can be found analytically Schrijver, Alexander (2003), Combinatorial Optimization: Polyhedra and Efficiency, Volume 1, Algorithms and Combinatorics

Attack path management (542 words) [view diff] case mismatch in snippet view article find links to article

"Heat-ray: Combating Identity Snowball Attacks Using Machine Learning, Combinatorial Optimization and Attack Graphs" (PDF). sigops.org. Gibson, Kirsten (2025-01-23)

Combinatorica (412 words) [view diff] exact match in snippet view article find links to article

Lovász, A. Schrujver: The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1(1981), 169–197. József Beck's paper on the discrepancy

Edge cover (627 words) [view diff] exact match in snippet view article find links to article

other one is NP-hard. See also p. 190. Lawler, Eugene L. (2001), Combinatorial optimization: networks and matroids, Dover Publications, pp. 222–223, ISBN 978-0-486-41453-9

Instruction selection (852 words) [view diff] exact match in snippet view article find links to article

most often solved using either greedy algorithms or methods from combinatorial optimization. Blindell, Gabriel S. Hjort (2013). Survey on Instruction Selection:

Complement graph (1,125 words) [view diff] case mismatch in snippet view article find links to article

compression schemes for dense and complement graphs", Journal of Combinatorial Optimization, 2 (4): 351–359, doi:10.1023/A:1009720402326, MR 1669307.

Toy model (624 words) [view diff] case mismatch in snippet view article find links to article

Alexander K.; Weigt, Martin (2006-05-12). Phase Transitions in Combinatorial Optimization Problems: Basics, Algorithms and Statistical Mechanics. John Wiley

András Frank (332 words) [view diff] exact match in snippet view article find links to article

"An application of simultaneous diophantine approximation in combinatorial optimization", Combinatorica, 7 (1): 49–65, doi:10.1007/BF02579200, S2CID 45585308

Bitonic tour (682 words) [view diff] case mismatch in snippet view article find links to article

"Lexicographically minimizing axial motions for the Euclidean TSP", Journal of Combinatorial Optimization, 19 (1): 1–15, doi:10.1007/s10878-008-9154-0, MR 2579501, S2CID 42168298

Path (graph theory) (1,175 words) [view diff] case mismatch in snippet view article

algorithm for the minimum 3-path partition problem". Journal of Combinatorial Optimization. 38 (1): 150–164. doi:10.1007/s10878-018-00372-z. ISSN 1382-6905

Traveling purchaser problem (204 words) [view diff] exact match in snippet view article find links to article

Problem in combinatorial optimization

K-set (geometry) (1,881 words) [view diff] exact match in snippet view article

3 (4): 352–366. Gusfield, D. (1980). Sensitivity analysis for combinatorial optimization. Tech. Rep. UCB/ERL M80/22. University of California, Berkeley

Laurence Wolsey (601 words) [view diff] case mismatch in snippet view article find links to article

implementation contributed to Open-Source during the year. Integer and Combinatorial Optimization (with George L. Nemhauser, Wiley, 1988) Integer Programming (Wiley

Capsule (geometry) (579 words) [view diff] case mismatch in snippet view article

William; Lovász, László; Vygen, Jens (eds.). Research Trends in Combinatorial Optimization. Springer, Berlin. pp. 347–363. doi:10.1007/978-3-540-76796-1_16

Bio-inspired computing (2,984 words) [view diff] exact match in snippet view article find links to article

Neumann, Frank; Witt, Carsten (2010). Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity. Natural Computing

Kenneth Steiglitz (291 words) [view diff] case mismatch in snippet view article find links to article

Computer Music, Prentice-Hall, Englewood Cliffs, New Jersey, 1996. Combinatorial Optimization: Algorithms and Complexity (with C. H. Papadimitriou), Prentice-Hall

Line perfect graph (300 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Russell Impagliazzo (820 words) [view diff] case mismatch in snippet view article find links to article

and Circuit Lower Bounds". Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International

Strength of a graph (508 words) [view diff] case mismatch in snippet view article find links to article

network, J of ACM, 32:549–561, 1985. A. Schrijver. Chapter 51. Combinatorial Optimization, Springer, 2003. V. A. Trubin. Strength of a graph and packing

EU/ME, the metaheuristics community (874 words) [view diff] exact match in snippet view article find links to article

following the 2000 EURO Winter Institute on metaheuristics for combinatorial optimization held in Lac Noir, Switzerland. In 2001, the group received its

Dirk Kroese (579 words) [view diff] case mismatch in snippet view article find links to article

D.P. (2004). The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning, Springer, New York

Susanne Albers (414 words) [view diff] case mismatch in snippet view article find links to article

P., Rolim; Dana, Ron (2004). Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques: 7th International Workshop on Approximation

Approximation error (1,153 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Alexander Barvinok (216 words) [view diff] case mismatch in snippet view article find links to article

Combinatorial Theory of Polytopes with Symmetry and its Applications to Combinatorial Optimization Problems (1988) Doctoral advisor Anatoly Moiseevich Vershik

Dual matroid (972 words) [view diff] case mismatch in snippet view article find links to article

linear matroid is a linear matroid. Schrijver, Alexander (2003), Combinatorial Optimization: Polyhedra and Efficiency. Vol. B: Matroids, Trees, Stable Sets

Total dual integrality (318 words) [view diff] case mismatch in snippet view article find links to article

Integrality". Linear Algebra and its Applications. 38: 27–32. doi:10.1016/0024-3795(81)90005-7. Chekuri, C. "Combinatorial Optimization Lecture Notes" (PDF).

Strongly-polynomial time (1,011 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Budget-additive valuation (850 words) [view diff] case mismatch in snippet view article find links to article

; Rubinfeld, Ronitt (eds.). Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science

Giovanni Fagnano (403 words) [view diff] case mismatch in snippet view article find links to article

Connectivity: An Introduction with Applications in Phylogeny, Combinatorial Optimization, vol. 17, Springer, p. 6, ISBN 9780387235394 Plastria, Frank (2006)

Artificial immune system (1,703 words) [view diff] case mismatch in snippet view article find links to article

Cutello and G. Nicosia (2002) "An Immunological Approach to Combinatorial Optimization Problems" Lecture Notes in Computer Science, Springer vol. 2527

Graph toughness (636 words) [view diff] case mismatch in snippet view article find links to article

Hamiltonian", Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1997), Discrete Applied Mathematics, 99 (1–3) (1-3 ed

SPECint (645 words) [view diff] case mismatch in snippet view article find links to article

Based on gcc Version 3.2, generates code for Opteron. 429.mcf C Combinatorial Optimization Vehicle scheduling. Uses a network simplex algorithm (which is

Igor Rivin (840 words) [view diff] exact match in snippet view article find links to article

51–70. doi:10.2307/2118652. JSTOR 2118652. Rivin, I. (2003). "Combinatorial optimization in geometry". Advances in Applied Mathematics. 31: 242–271. arXiv:math/9907032

John ellipsoid (968 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Restricted isometry property (862 words) [view diff] case mismatch in snippet view article find links to article

Restricted Isometry Property," Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014) (2014) F. Yang

Darts (6,575 words) [view diff] case mismatch in snippet view article find links to article

Darts Info World Eiselt, H; Laporte, Gilbert (February 1991). "A Combinatorial Optimization Problem Arising in Dartboard Design". The Journal of the Operational

Evolution strategy (2,054 words) [view diff] case mismatch in snippet view article find links to article

Self-Adaptive Evolution Strategies Guided by Neighborhood Structures for Combinatorial Optimization Problems". Evolutionary Computation. 24 (4): 637–666. doi:10.1162/EVCO_a_00187

Bidirected graph (347 words) [view diff] case mismatch in snippet view article find links to article

Symposium, June 1969, New York: Gordon and Breach. Reprinted in Combinatorial Optimization — Eureka, You Shrink!, Springer-Verlag, Lecture Notes in Computer

Real RAM (826 words) [view diff] exact match in snippet view article find links to article

(1981-06-01). "The ellipsoid method and its consequences in combinatorial optimization". Combinatorica. 1 (2): 169–197. doi:10.1007/BF02579273. ISSN 1439-6912

L-reduction (1,017 words) [view diff] exact match in snippet view article find links to article

Marchetti-Spaccamela, M. Protasi. Complexity and Approximation. Combinatorial optimization problems and their approximability properties. 1999, Springer

F. Thomson Leighton (785 words) [view diff] exact match in snippet view article find links to article

cryptography, parallel architectures, distributed computing, combinatorial optimization, and graph theory. He also holds patents involving content delivery

Sperner family (1,101 words) [view diff] exact match in snippet view article find links to article

typically asked. Clutters are an important structure in the study of combinatorial optimization. In more complicated language, a clutter is a hypergraph ( V

Timothy Law Snyder (636 words) [view diff] case mismatch in snippet view article find links to article

Asymptotic Worst Case Lengths in Some Problems from Classical Computational Geometry and Combinatorial Optimization (1987) Doctoral advisor J. Michael Steele

Multi-fragment algorithm (131 words) [view diff] case mismatch in snippet view article find links to article

"The Traveling Salesman Problem: A Case Study in Local Optimization". Local Search in Combinatorial Optimization. 1. CiteSeerX 10.1.1.92.1635. v t e

Breakthrough Prize in Mathematics (1,408 words) [view diff] exact match in snippet view article find links to article

Vera Traub – "For advances in approximation results in classical combinatorial optimization problems, including the traveling salesman problem and network

Duality gap (844 words) [view diff] exact match in snippet view article find links to article

relaxation". In Jünger, Michael; Naddef, Denis (eds.). Computational combinatorial optimization: Papers from the Spring School held in Schloß Dagstuhl, May 15–19

Aurelie Thiele (563 words) [view diff] case mismatch in snippet view article find links to article

Bienstock, Daniel; Nemhauser, George (eds.). Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Vol. 3064. Springer Berlin

Hazel Perfect (805 words) [view diff] exact match in snippet view article find links to article

Mathematical Society, p. 41, December 2015 Schrijver, Alexander (2003), Combinatorial optimization: Polyhedra and efficiency, Vol. B: Matroids, trees, stable sets

Woodall's conjecture (621 words) [view diff] case mismatch in snippet view article find links to article

(1982), "Min-max relations for directed graphs", Bonn Workshop on Combinatorial Optimization (Bonn, 1980), Annals of Discrete Mathematics, vol. 16, North-Holland

Fully polynomial-time approximation scheme (5,027 words) [view diff] exact match in snippet view article find links to article

Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation: Combinatorial optimization problems and their approximability properties, Springer-Verlag

Comet (disambiguation) (1,133 words) [view diff] exact match in snippet view article

server-push communication Comet (programming language), used to solve combinatorial optimization problems Comet (pyrotechnics), a firework component The "Comet"

Bin packing problem (6,988 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0471924202 Korte, Bernhard; Vygen, Jens (2006). "Bin-Packing". Combinatorial Optimization: Theory and Algorithms. Algorithms and Combinatorics 21. Springer

Trivially perfect graph (1,189 words) [view diff] case mismatch in snippet view article find links to article

modification problems", in Wu, Weili; Daescu, Ovidiu (eds.), Combinatorial Optimization and Applications – 4th International Conference, COCOA 2010, Kailua-Kona

Vertex cycle cover (411 words) [view diff] case mismatch in snippet view article find links to article

and Computing Systems, 108-117. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties (1999) ISBN 3-540-65431-3

Marius Lindauer (591 words) [view diff] exact match in snippet view article find links to article

several international competitions in the fields of solving hard combinatorial optimization problems, including 1st place in the NP-track of the answer set

László Lovász (1,325 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Edward G. Coffman Jr. (546 words) [view diff] exact match in snippet view article find links to article

mathematics. The directions he has taken have drawn on the tools of combinatorial optimization and the theory of algorithms, along with those of applied probability

Michel Deza (1,298 words) [view diff] case mismatch in snippet view article find links to article

of the Fields Institute who holds a Canada Research Chair in Combinatorial Optimization at McMaster University, combines Michel Deza's interests in polyhedral

Lagrangian relaxation (1,098 words) [view diff] exact match in snippet view article find links to article

relaxation". In Michael Jünger and Denis Naddef (ed.). Computational combinatorial optimization: Papers from the Spring School held in Schloß Dagstuhl, May 15–19

Mihalis Yannakakis (1,448 words) [view diff] case mismatch in snippet view article find links to article

include the Journal of Computer and System Sciences, the Journal of Combinatorial Optimization, and the Journal of Complexity. He has also served on conference

Michel Deza (1,298 words) [view diff] case mismatch in snippet view article find links to article

of the Fields Institute who holds a Canada Research Chair in Combinatorial Optimization at McMaster University, combines Michel Deza's interests in polyhedral

Claude Lemaréchal (1,257 words) [view diff] exact match in snippet view article find links to article

relaxation". In Michael Jünger and Denis Naddef (ed.). Computational combinatorial optimization: Papers from the Spring School held in Schloß Dagstuhl, May 15–19

Meigu Guan (605 words) [view diff] case mismatch in snippet view article find links to article

Circuit Board Production: Some Issues", Beijing Block Course "Combinatorial Optimization at Work" (PDF), Institute of Computational Mathematics and

Maximal evenness (599 words) [view diff] case mismatch in snippet view article find links to article

Common Threads in Mathematics, Physics and Music". Journal of Combinatorial Optimization. 14 (4): 385-410. doi:10.1007/s10878-006-9041-5. S2CID 41964397

Fibbinary number (864 words) [view diff] case mismatch in snippet view article find links to article

(2013), "Structure of Fibonacci cubes: a survey", Journal of Combinatorial Optimization, 25 (4): 505–522, doi:10.1007/s10878-011-9433-z, MR 3044155, S2CID 5557314

Complement (complexity) (675 words) [view diff] case mismatch in snippet view article

ISBN 9783540274773. Ausiello, Giorgio (1999), Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer, p. 189

Treewidth (4,569 words) [view diff] exact match in snippet view article find links to article

beginning of the 1970s, it was observed that a large class of combinatorial optimization problems defined on graphs could be efficiently solved by non

Baruch Schieber (835 words) [view diff] exact match in snippet view article find links to article

provably efficient, approximation algorithms for intractable combinatorial optimization problems. For these problems, which defy exhaustive search solutions

Tutte–Berge formula (969 words) [view diff] case mismatch in snippet view article find links to article

ISBN 0-444-87916-1. MR 0859549. Schrijver, Alexander (2003). Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag. p. 413. ISBN 3-540-44389-4

MAX-3SAT (1,450 words) [view diff] case mismatch in snippet view article find links to article

Spaccamela, A., and Protasi, M. (1999), Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties, Springer-Verlag

Multiple-criteria decision analysis (5,905 words) [view diff] case mismatch in snippet view article find links to article

variables, the design problems become harder to solve. Multiobjective Combinatorial Optimization (MOCO) constitutes a special category of such problems posing

Algorithmic composition (2,115 words) [view diff] exact match in snippet view article find links to article

When generating well defined styles, music can be seen as a combinatorial optimization problem, whereby the aim is to find the right combination of notes

Matroid rank (1,429 words) [view diff] case mismatch in snippet view article find links to article

valuations. Rank oracle Shikare, M. M.; Waphare, B. N. (2004), Combinatorial Optimization, Alpha Science Int'l Ltd., p. 155, ISBN 9788173195600. Welsh,

Nested set collection (815 words) [view diff] case mismatch in snippet view article find links to article

information in relational databases B. Korte and J. Vygen (2012). Combinatorial Optimization. Springer, Heidelberg. "Digital Libraries and Archives: 8th Italian

Fractional coloring (1,271 words) [view diff] case mismatch in snippet view article find links to article

(5): 910–917. doi:10.1109/18.21215. Schrijver, Alexander (2003). Combinatorial Optimization: Polyhedra and Efficiency. Berlin; Heidelberg; New York, N.Y.:

Tree decomposition (1,537 words) [view diff] exact match in snippet view article find links to article

beginning of the 1970s, it was observed that a large class of combinatorial optimization problems defined on graphs could be efficiently solved by non-serial

Polytope (3,119 words) [view diff] case mismatch in snippet view article find links to article

CUP (ppbk 1999) pp 205 ff. Nemhauser and Wolsey, "Integer and Combinatorial Optimization," 1999, ISBN 978-0471359432, Definition 2.2. Johnson, Norman W

Polyhedral combinatorics (2,304 words) [view diff] exact match in snippet view article find links to article

polytopes that have vertices corresponding to the solutions of combinatorial optimization problems. Often, these problems have solutions that can be described

Set packing (1,514 words) [view diff] case mismatch in snippet view article find links to article

Eduardo Neves; Mahjoub, A. Ridha; Paschos, Vangelis T. (eds.). Combinatorial Optimization. Lecture Notes in Computer Science. Vol. 8596. Cham: Springer

Rainbow coloring (1,095 words) [view diff] case mismatch in snippet view article find links to article

"Hardness and algorithms for rainbow connection", Journal of Combinatorial Optimization, 21 (3): 330–347, arXiv:0809.2493, doi:10.1007/s10878-009-9250-9

Triangle-free graph (2,524 words) [view diff] exact match in snippet view article find links to article

imply lower bounds for several other computational problems in combinatorial optimization and computational geometry. As Imrich, Klavžar & Mulder (1999)

Cathal MacSwiney Brugha (700 words) [view diff] case mismatch in snippet view article find links to article

Brugha earned a BSc, an MSc (Mathematical Science – UCD), a PhD (Combinatorial Optimization - UCD) and MBA (TCD) Prize winner for his dissertation. Brugha

Tardos function (449 words) [view diff] exact match in snippet view article find links to article

Schrijver, A. (1981), "The ellipsoid method and its consequences in combinatorial optimization", Combinatorica, 1 (2): 169–197, doi:10.1007/BF02579273, MR 0625550

Albert Wagelmans (1,070 words) [view diff] exact match in snippet view article find links to article

received his Phd with the thesis entitled "Sensitivity analysis in combinatorial optimization," under supervision of Alexander Rinnooy Kan and Antoon Kolen

Gerald L. Thompson (787 words) [view diff] exact match in snippet view article find links to article

economics. His research encompassed mathematical programming, combinatorial optimization, production planning, large scale linear and network programming

Julia Robinson (2,184 words) [view diff] exact match in snippet view article find links to article

via DTIC. Alexander Schrijver's 2005 paper "On the history of combinatorial optimization (till 1960). Handbook of Discrete Optimization (K. Aardal, G.L

Bikas Chakrabarti (1,755 words) [view diff] exact match in snippet view article find links to article

could offer potential solutions to the challenges inherent in combinatorial optimization problems [Ray, Chakrabarti & Chakrabarti, Phys. Rev. B (1989);

Gödel Prize (2,163 words) [view diff] case mismatch in snippet view article find links to article

Wolf, Ronald (2015). "Exponential Lower Bounds for Polytopes in Combinatorial Optimization". Journal of the ACM. 62 (2): 17:1–17:23. arXiv:1111.0837. doi:10

Maximum flow problem (5,227 words) [view diff] case mismatch in snippet view article find links to article

maximum flow problem with disjunctive constraints". Journal of Combinatorial Optimization. 26 (1): 109–119. CiteSeerX 10.1.1.414.4496. doi:10.1007/s10878-011-9438-7

King's graph (647 words) [view diff] exact match in snippet view article find links to article

graphs", in Du, Ding-Zhu; Pardalos, Panos M. (eds.), Handbook of combinatorial optimization, Vol. 3, Boston, MA: Kluwer Acad. Publ., pp. 339–405, MR 1665419

Linear-fractional programming (1,352 words) [view diff] case mismatch in snippet view article find links to article

Discrete and fractional programming techniques for location models. Combinatorial Optimization. Vol. 3. Dordrecht: Kluwer Academic Publishers. pp. xviii+178

Markov random field (2,838 words) [view diff] case mismatch in snippet view article find links to article

; Tarlow, Daniel; Elidan, Gal; Koller, Daphne (2006), "Using Combinatorial Optimization within Max-Product Belief Propagation", in Schölkopf, Bernhard;

Hajós construction (1,470 words) [view diff] exact match in snippet view article find links to article

Euler, Reinhardt (2003), "Hajós' construction and polytopes", Combinatorial optimization—Eureka, you shrink!, Lecture Notes in Computer Science, vol. 2570

Gammoid (1,452 words) [view diff] case mismatch in snippet view article find links to article

1112/plms/s3-25.1.55, MR 0311496. Schrijver, Alexander (2003), Combinatorial Optimization: Polyhedra and Efficiency. Vol. B: Matroids, Trees, Stable Sets

Hermite normal form (1,849 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Feedback vertex set (1,805 words) [view diff] case mismatch in snippet view article find links to article

problems", in Du, D.-Z.; Pardalos, P. M. (eds.), Handbook of Combinatorial Optimization, Supplement vol. A (PDF), Kluwer Academic Publishers, pp. 209–259

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

Problem (BCP) or the Bid Generation Problem (BGP) is a NP-Hard combinatorial optimization problem addressed by the bidder in order to determine items it

Zbigniew Michalewicz (1,334 words) [view diff] exact match in snippet view article find links to article

reproductive potential of offspring in evolutionary heuristics for combinatorial optimization problems". 2011 IEEE Congress of Evolutionary Computation (CEC)

Quasiregular element (1,658 words) [view diff] exact match in snippet view article find links to article

1007/978-3-642-01492-5_1, pp. 7-10 U. Zimmermann (1981). Linear and combinatorial optimization in ordered algebraic structures. Elsevier. p. 141. ISBN 978-0-08-086773-1

Transversal (combinatorics) (1,655 words) [view diff] case mismatch in snippet view article

monthly.118.09.777. ISSN 0002-9890. S2CID 27202372. Lawler, E. L. Combinatorial Optimization: Networks and Matroids. 1976. Mirsky, Leon (1971). Transversal

Michael Fellows (1,630 words) [view diff] case mismatch in snippet view article find links to article

a Special Issue on Parameterized Complexity in the Journal of Combinatorial Optimization to be published in 2010. He is a member of the Steering Committee

Gabriela Ochoa (847 words) [view diff] case mismatch in snippet view article find links to article

Valley Search Space Hypothesis". Evolutionary Computation in Combinatorial Optimization. Lecture Notes in Computer Science. Cham: Springer International

Blossom algorithm (2,022 words) [view diff] case mismatch in snippet view article find links to article

125–130. doi:10.6028/jres.069B.013. Schrijver, Alexander (2003). Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics. Berlin

Sturmian word (1,939 words) [view diff] case mismatch in snippet view article find links to article

Deterministic Periodic Routing sequences". Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science. Vol. 2081. p. 236. doi:10

Dense subgraph (1,881 words) [view diff] case mismatch in snippet view article find links to article

Jansen, Klaus; Khuller, Samir (eds.), Approximation Algorithms for Combinatorial Optimization, Third International Workshop, APPROX 2000, Saarbrücken, Germany

Alexander Rinnooy Kan (727 words) [view diff] case mismatch in snippet view article find links to article

June 2019. 1985 The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. With Eugene L. Lawler, Jan Karel Lenstra, and David B. Shmoys

Vertex cover (2,556 words) [view diff] case mismatch in snippet view article find links to article

06.019. Papadimitriou, Christos H.; Steiglitz, Kenneth (1998). Combinatorial Optimization: Algorithms and Complexity. Dover. Vazirani, Vijay V. (2003).

Factor-critical graph (1,801 words) [view diff] case mismatch in snippet view article find links to article

(2008), "10.4 Ear-Decompositions of Factor-Critical Graphs", Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics, vol. 21

Facility location (competitive game) (766 words) [view diff] case mismatch in snippet view article

Issues in Competitive Games". Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science

Ear decomposition (1,904 words) [view diff] case mismatch in snippet view article find links to article

0750, Bibcode:2013arXiv1311.0750S. Schrijver, Alexander (2003), Combinatorial Optimization. Polyhedra and efficiency. Vol A, Springer-Verlag, ISBN 978-3-540-44389-6

Arc routing (4,812 words) [view diff] exact match in snippet view article find links to article

Optimization problem Travelling salesman problem – NP-hard problem in combinatorial optimization Eulerian path – Trail in a graph that visits each edge once Capacitated

Bellman–Ford algorithm (2,715 words) [view diff] exact match in snippet view article find links to article

ISBN 978-1-84800-997-4. Schrijver, Alexander (2005). "On the history of combinatorial optimization (till 1960)" (PDF). Handbook of Discrete Optimization. Elsevier:

Halin graph (2,157 words) [view diff] case mismatch in snippet view article find links to article

Raspaud, André (2012), "On backbone coloring of graphs", Journal of Combinatorial Optimization, 23 (1): 79–93, doi:10.1007/s10878-010-9342-6, MR 2875236, S2CID 26975523:

Fleischner's theorem (1,515 words) [view diff] case mismatch in snippet view article find links to article

Hamiltonian", Proceedings of the 5th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1997), Discrete Applied Mathematics, 99 (1–3): 317–321

Hugh Everett III (3,851 words) [view diff] exact match in snippet view article find links to article

relaxation". In Michael Jünger and Denis Naddef (ed.). Computational combinatorial optimization: Papers from the Spring School held in Schloß Dagstuhl, May 15–19

Threading (protein sequence) (2,013 words) [view diff] exact match in snippet view article

threading).[citation needed] Researchers have made use of many combinatorial optimization methods such as conditional random fields, simulated annealing

Skew-symmetric graph (2,318 words) [view diff] case mismatch in snippet view article find links to article

Symposium, June 1969, New York: Gordon and Breach. Reprinted in Combinatorial Optimization — Eureka, You Shrink!, Springer-Verlag, Lecture Notes in Computer

Independent set (graph theory) (3,561 words) [view diff] exact match in snippet view article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Graph theory (6,207 words) [view diff] case mismatch in snippet view article find links to article

and links to graph library implementations Phase Transitions in Combinatorial Optimization Problems, Section 3: Introduction to Graphs (2006) by Hartmann

Exponential time hypothesis (3,061 words) [view diff] case mismatch in snippet view article find links to article

Gerhard (2003), "Exact algorithms for NP-hard problems: A survey", Combinatorial Optimization — Eureka, You Shrink! (PDF), Lecture Notes in Computer Science

Cograph (2,689 words) [view diff] case mismatch in snippet view article find links to article

chordal graph embeddings", 4th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1995), Discrete Applied Mathematics, 79 (1–3): 171–188

National Institute of Statistics and Applied Economics (1,581 words) [view diff] exact match in snippet view article find links to article

Research, research and preparation of OR in the following areas: Combinatorial optimization, Graphs and Combinatorics and Discrete Mathematics. Through cross-training

Convex cone (3,945 words) [view diff] case mismatch in snippet view article find links to article

ISBN 9783319110080. Korte, Bernhard; Vygen, Jens (2013-11-11). Combinatorial Optimization: Theory and Algorithms. Springer Science & Business Media. p. 61

Word-representable graph (3,653 words) [view diff] case mismatch in snippet view article find links to article

preserving semi-transitive orient ability of graphs, Journal of Combinatorial Optimization 37 (2019) 4, 1351−1366. A. Collins, S. Kitaev, and V. Lozin. New

Exponential time hypothesis (3,061 words) [view diff] case mismatch in snippet view article find links to article

Gerhard (2003), "Exact algorithms for NP-hard problems: A survey", Combinatorial Optimization — Eureka, You Shrink! (PDF), Lecture Notes in Computer Science

Matching polytope (1,552 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Quantum machine learning (10,780 words) [view diff] exact match in snippet view article find links to article

those produced by D-Wave Systems, were designed for challenging combinatorial optimization problems, it has been recently recognized as a potential candidate

PLS (complexity) (5,471 words) [view diff] exact match in snippet view article

cosrev.2009.03.004. Yannakakis, Mihalis (2003). Local search in combinatorial optimization - Computational complexity. Princeton University Press. pp. 19–55

Radon's theorem (2,424 words) [view diff] case mismatch in snippet view article find links to article

Connectivity: An Introduction with Applications in Phylogeny, Combinatorial Optimization, vol. 17, Springer, p. 6, ISBN 9780387235394. Plastria, Frank

Cereceda's conjecture (1,322 words) [view diff] case mismatch in snippet view article find links to article

colourings of chordal and chordal bipartite graphs" (PDF), Journal of Combinatorial Optimization, 27 (1): 132–143, doi:10.1007/s10878-012-9490-y, MR 3149109, S2CID 254648357

Consensus clustering (2,951 words) [view diff] exact match in snippet view article find links to article

ensembles. The cluster ensemble problem is then formalized as a combinatorial optimization problem in terms of shared mutual information VEGA-PONS, SANDRO;

Weighted matroid (1,652 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993). Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics. Vol. 2 (Second ed.). Springer-Verlag

Separation oracle (1,626 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Analysis of algorithms (3,708 words) [view diff] exact match in snippet view article find links to article

ISBN 978-3-540-14015-3. Giorgio Ausiello (1999). Complexity and approximation: combinatorial optimization problems and their approximability properties. Springer. pp. 3–8

Geometric median (2,829 words) [view diff] case mismatch in snippet view article find links to article

Connectivity: An Introduction with Applications in Phylogeny. Combinatorial Optimization. Vol. 17. Springer. p. 3. ISBN 9780387235394. Cockayne, E. J.;

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

Programming Languages, Network Flow Algorithms, Network Optimization, Combinatorial Optimization, Database Management Systems, Design of Production Systems and

Time complexity (5,004 words) [view diff] case mismatch in snippet view article find links to article

"Derandomizing Complexity Classes". Handbook of Randomized Computing. Combinatorial Optimization. Vol. 9. Kluwer Academic Pub. p. 843. doi:10.1007/978-1-4615-0013-1_19

Balls into bins problem (1,958 words) [view diff] case mismatch in snippet view article find links to article

APPROX 2012, RANDOM 2012: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. pp. 411–422. CiteSeerX 10.1.1.297

Florent Krzakala (1,006 words) [view diff] exact match in snippet view article find links to article

solved with similar techniques. He has notably worked in random combinatorial optimization, coding and information theory, statistical inference, machine

Gaussian elimination (4,368 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Gram–Schmidt process (4,423 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Chordal completion (1,352 words) [view diff] case mismatch in snippet view article find links to article

chordal graph embeddings", 4th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1995), Discrete Applied Mathematics, 79 (1–3): 171–188

Proof of work (4,045 words) [view diff] case mismatch in snippet view article find links to article

original on 2016-08-26. Retrieved 2007-11-25. Fitzi, Matthias. "Combinatorial Optimization via Proof-of-Useful-Work" (PDF). IACR conference Crypto 2022.

Set cover problem (2,683 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-3-540-65367-7 Korte, Bernhard; Vygen, Jens (2012), Combinatorial Optimization: Theory and Algorithms (5 ed.), Springer, ISBN 978-3-642-24487-2

Steinhaus–Johnson–Trotter algorithm (2,860 words) [view diff] case mismatch in snippet view article find links to article

Proceedings of the School on Analysis and Design of Algorithms in Combinatorial Optimization, Udine, Italy (PDF), Technical report 8003/0, Erasmus University

Graph minor (4,046 words) [view diff] case mismatch in snippet view article find links to article

Proc. 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), Lecture Notes in Computer Science, vol. 2462, Springer-Verlag

Undergraduate Texts in Mathematics (4,182 words) [view diff] case mismatch in snippet view article find links to article

(1984). Why Math?. ISBN 978-0-387-90973-8. Foulds, L. R. (1984). Combinatorial Optimization for Undergraduates. ISBN 978-0-387-90977-6. Jänich, Klaus (1984)

Clique problem (9,905 words) [view diff] case mismatch in snippet view article find links to article

Pelillo, M. (1999), "The maximum clique problem", Handbook of Combinatorial Optimization, vol. 4, Kluwer Academic Publishers, pp. 1–74, CiteSeerX 10.1

Isolation lemma (1,903 words) [view diff] case mismatch in snippet view article find links to article

international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques. Boston, MA, USA: Springer-Verlag.

Ellipsoid (5,922 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Equitable coloring (2,290 words) [view diff] exact match in snippet view article find links to article

complexity of some colorful problems parameterized by treewidth", Combinatorial optimization and applications (PDF), Lecture Notes in Computer Science, vol

Giorgio Ausiello (623 words) [view diff] case mismatch in snippet view article find links to article

Marchetti-Spaccamela, M. Protasi 'Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties', Springer, 1999

Subset sum problem (3,781 words) [view diff] exact match in snippet view article find links to article

present other FPTASes for subset sum. Knapsack problem – Problem in combinatorial optimization - a generalization of SSP in which each input item has both a

Mykhailo Zghurovskyi (1,683 words) [view diff] case mismatch in snippet view article find links to article

Publishing Switzerland, 2019. – 557 p. Zgurovsky M.Z., Pavlov A.A. Combinatorial Optimization Problems in Planning and Decision Making: Theory and Applications

Tuza's conjecture (809 words) [view diff] case mismatch in snippet view article find links to article

Lawler, Eugene L. (1976), "Chapter 9: The Matroid Parity Problem", Combinatorial Optimization: Networks and Matroids, New York: Holt, Rinehart and Winston,

Farkas' lemma (2,998 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Computational hardness assumption (3,303 words) [view diff] case mismatch in snippet view article find links to article

Gerhard (2003). "Exact algorithms for NP-hard problems: A survey". Combinatorial Optimization — Eureka, You Shrink!. Lecture Notes in Computer Science. Vol

List of women in mathematics (23,187 words) [view diff] exact match in snippet view article find links to article

of mathematics Kathrin Klamroth (born 1968), German expert on combinatorial optimization and facility location Erica Klarreich (born 1972), American geometer

D-Wave Systems (3,455 words) [view diff] case mismatch in snippet view article find links to article

"Experimental Evaluation of an Adiabatic Quantum System for Combinatorial Optimization". Aron, Jacob (8 March 2013). "Controversial quantum computer

Diophantine approximation (4,071 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Reverse-search algorithm (2,054 words) [view diff] case mismatch in snippet view article find links to article

polyomino and computer search of isospectral polyominoes", Journal of Combinatorial Optimization, 33 (1): 254–264, doi:10.1007/s10878-015-9953-z, MR 3595411, S2CID 254655722

Kőnig's theorem (graph theory) (3,433 words) [view diff] case mismatch in snippet view article

William H.; Pulleyblank, William R.; Schrijver, Alexander (2011), Combinatorial Optimization, Wiley Series in Discrete Mathematics and Optimization, vol. 33

Lovász–Woodall conjecture (1,001 words) [view diff] case mismatch in snippet view article find links to article

Alessandro; Rinaldi, Giovanni (eds.), Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May

Quantum refereed game (3,254 words) [view diff] case mismatch in snippet view article find links to article

M; Lovász L.; Schrijver, A. (1988). Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics. Springer. ISBN 978-3-642-97883-8

Jingbo Wang (1,129 words) [view diff] exact match in snippet view article find links to article

1007/s11128-019-2171-3. S2CID 254986174. Marsh, S.; Wang, J. B. (2020). "Combinatorial optimization via highly efficient quantum walks". Physical Review Research

Aggelos Kiayias (2,100 words) [view diff] case mismatch in snippet view article find links to article

its boss". New Scientist. Retrieved 27 January 2022. "Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work \ A Provably Secure Blockchain Protocol"

Quantum refereed game (3,254 words) [view diff] case mismatch in snippet view article find links to article

M; Lovász L.; Schrijver, A. (1988). Geometric Algorithms and Combinatorial Optimization. Algorithms and Combinatorics. Springer. ISBN 978-3-642-97883-8

Subset simulation (1,505 words) [view diff] case mismatch in snippet view article find links to article

"An Efficient Algorithm for Rare-event Probability Estimation, Combinatorial Optimization, and Counting". Methodology and Computing in Applied Probability

Minimum spanning tree (5,460 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Genetic algorithm (8,044 words) [view diff] case mismatch in snippet view article find links to article

Nicolas; Dorigo, Marco (1 October 2004). "Model-Based Search for Combinatorial Optimization: A Critical Survey". Annals of Operations Research. 131 (1–4):

Lagrange multiplier (7,987 words) [view diff] exact match in snippet view article find links to article

relaxation". In Jünger, Michael; Naddef, Denis (eds.). Computational combinatorial optimization: Papers from the Spring School held in Schloß Dagstuhl. Spring

Sequence alignment (6,921 words) [view diff] exact match in snippet view article find links to article

produce and most formulations of the problem lead to NP-complete combinatorial optimization problems. Nevertheless, the utility of these alignments in bioinformatics

Cellular neural network (10,029 words) [view diff] case mismatch in snippet view article find links to article

and M. Tanaka, "Hysteresis Cellular Neural Networks for Solving Combinatorial Optimization Problems", Int’l Workshop on Cellular Neural Networks and Their

Ronald Graham (4,467 words) [view diff] case mismatch in snippet view article find links to article

; Lucertini, M. (eds.). Analysis and Design of Algorithms in Combinatorial Optimization. Courses and Lectures of the International Centre for Mechanical

Agreeable subset (1,620 words) [view diff] case mismatch in snippet view article find links to article

(2019-04-01). "Agreeable sets with matroidal constraints". Journal of Combinatorial Optimization. 37 (3): 866–888. doi:10.1007/s10878-018-0327-1. ISSN 1573-2886

Graph structure theorem (2,783 words) [view diff] case mismatch in snippet view article find links to article

Proc. 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2002), Lecture Notes in Computer Science, vol. 2462, Springer-Verlag

Transportation theory (mathematics) (4,442 words) [view diff] case mismatch in snippet view article

pour la même année, pages 666–704, 1781. Schrijver, Alexander, Combinatorial Optimization, Berlin; New York : Springer, 2003. ISBN 3540443894. Cf. p. 362

Minimum-weight triangulation (3,289 words) [view diff] case mismatch in snippet view article find links to article

Yin-Feng (1998), "Minimum weight triangulations", Handbook of Combinatorial Optimization, Vol. 2, Boston, MA: Kluwer Academic Publishers, pp. 617–634,

Shortest path problem (4,451 words) [view diff] case mismatch in snippet view article find links to article

("private communication") on p. 225. Schrijver, Alexander (2004). Combinatorial Optimization — Polyhedra and Efficiency. Algorithms and Combinatorics. Vol

Modular decomposition (3,177 words) [view diff] exact match in snippet view article find links to article

'99), perfect graphs, and other graph classes. Some important combinatorial optimization problems on graphs can be solved using a similar strategy (Möhring

Collin M. Stultz (1,352 words) [view diff] exact match in snippet view article find links to article

Stultz, C. M.; Karplus, M. (2000). "Dynamic ligand design and combinatorial optimization: designing inhibitors to endothiapepsin". Proteins. 40 (2): 258–89

Envy-free pricing (2,559 words) [view diff] case mismatch in snippet view article find links to article

José; Servedio, Rocco (eds.). Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science

Selection algorithm (5,755 words) [view diff] exact match in snippet view article find links to article

has been applied to problems of listing multiple solutions to combinatorial optimization problems, such as finding the k shortest paths in a weighted graph

Turing machine (9,420 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

List of pioneers in computer science (1,564 words) [view diff] exact match in snippet view article find links to article

development of efficient algorithms for network flow and other combinatorial optimization problems; identified polynomial-time computability with the intuitive

Optimal job scheduling (2,974 words) [view diff] case mismatch in snippet view article find links to article

scheduling: Complexity, algorithms and approximability". Handbook of Combinatorial Optimization (Volume 3) (Editors: D.-Z. Du and P. Pardalos), 1998, Kluwer Academic

Cycle basis (3,322 words) [view diff] case mismatch in snippet view article find links to article

minimum cycle basis in undirected graphs", Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO 2010, Lausanne, Switzerland

Entropy (information theory) (10,194 words) [view diff] case mismatch in snippet view article

March 2013). The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation and Machine Learning. Springer Science

Greedy coloring (3,887 words) [view diff] case mismatch in snippet view article find links to article

Andreas; Nishizeki, Takao (eds.), Handbook of Graph Theory, Combinatorial Optimization, and Algorithms, Chapman & Hall/CRC Computer and Information Science

List of University of Waterloo people (4,562 words) [view diff] case mismatch in snippet view article find links to article

Václav Chvátal Graduate Mathematics Canada Research Chair in Combinatorial Optimization and former professor at McGill and Stanford Ian Clark Graduate

Line graph (5,360 words) [view diff] case mismatch in snippet view article find links to article

of this theorem by Jung (1966). Paschos, Vangelis Th. (2010), Combinatorial Optimization and Theoretical Computer Science: Interfaces and Perspectives

Square-root sum problem (1,436 words) [view diff] exact match in snippet view article find links to article

Goemans, Michel X. (1997-10-01). "Semidefinite programming in combinatorial optimization". Mathematical Programming. 79 (1): 143–161. doi:10.1007/BF02614315

Energy conservation (10,167 words) [view diff] exact match in snippet view article find links to article

and reduce buildings' environmental impact. The selection of combinatorial optimization schemes that contain measures to guide and restrict users' behavior

Probabilistic context-free grammar (5,242 words) [view diff] case mismatch in snippet view article find links to article

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. Lecture Notes in Computer Science. Vol. 5015. pp. 323–327

Polyhedron (10,647 words) [view diff] exact match in snippet view article find links to article

László; Schrijver, Alexander (1993), Geometric algorithms and combinatorial optimization, Algorithms and Combinatorics, vol. 2 (2nd ed.), Springer-Verlag

Protein design (7,746 words) [view diff] exact match in snippet view article find links to article

DB; Mayo, SL (September 15, 1999). "Branch-and-terminate: a combinatorial optimization algorithm for protein design". Structure. 7 (9): 1089–98. doi:10

List of George Washington University alumni (13,083 words) [view diff] exact match in snippet view article find links to article

being one of the most important contributors to the field of combinatorial optimization William Greenleaf Eliot, founder of Washington University in St

Bhavin J. Shastri (1,356 words) [view diff] exact match in snippet view article find links to article

compared to electronic systems, potentially addressing challenges in combinatorial optimization and artificial intelligence, among other applications. In 2024

Sherief Reda (784 words) [view diff] exact match in snippet view article find links to article

and molecular computing. He has broad interests in the use of combinatorial optimization and machine learning for applications in both circuit design and

Natural computing (5,191 words) [view diff] exact match in snippet view article find links to article

Ant algorithms have been successfully applied to a variety of combinatorial optimization problems over discrete search spaces. Artificial immune systems

Edge coloring (8,472 words) [view diff] case mismatch in snippet view article find links to article

"Approximating the chromatic index of multigraphs", Journal of Combinatorial Optimization, 21 (2): 219–246, doi:10.1007/s10878-009-9232-y, MR 2770056, S2CID 169162

Strip packing problem (7,808 words) [view diff] case mismatch in snippet view article find links to article

Two-Dimensional Packing Problems". Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Lecture Notes in Computer Science

Interval scheduling (2,546 words) [view diff] case mismatch in snippet view article find links to article

Papadimitriou, Christos H.; Steiglitz, Kenneth (July 1998). Combinatorial Optimization : Algorithms and Complexity. Dover. ISBN 978-0-486-40258-1. Spieksma

Hopfield network (8,519 words) [view diff] exact match in snippet view article find links to article

network routing problem, image restoration, system identification, combinatorial optimization, etc, just to name a few. However, while it is possible to convert