Find link

language:

Find link is a tool written by Edward Betts.

searching for Integer programming 127 found (337 total)

FortMP (159 words) [view diff] exact match in snippet view article find links to article

linear programming problems, quadratic programming problems and mixed integer programming problems (both linear and quadratic). Its robustness has been explored

AMPL (1,108 words) [view diff] exact match in snippet view article find links to article

Linear programming Quadratic programming Nonlinear programming Mixed-integer programming Mixed-integer quadratic programming with or without convex quadratic

Hilbert basis (linear programming) (471 words) [view diff] no match in snippet view article

The Hilbert basis of a convex cone C is a minimal set of integer vectors in C such that every integer vector in C is a conical combination of the vectors

OR-Tools (469 words) [view diff] exact match in snippet view article find links to article

suite developed by Google for solving linear programming (LP), mixed integer programming (MIP), constraint programming (CP), vehicle routing (VRP), and related

APOPT (383 words) [view diff] exact match in snippet view article find links to article

constrained quadratic program (QCQP) Nonlinear programming (NLP) Mixed integer programming (MIP) Mixed integer linear programming (MILP) Mixed integer nonlinear

Nl (format) (294 words) [view diff] exact match in snippet view article

Linear programming Quadratic programming Nonlinear programming Mixed-integer programming Mixed-integer quadratic programming with or without convex quadratic

GNU Linear Programming Kit (336 words) [view diff] exact match in snippet view article find links to article

intended for solving large-scale linear programming (LP), mixed integer programming (MIP), and other related problems. It is a set of routines written

BARON (262 words) [view diff] exact match in snippet view article find links to article

solver. Linear programming (LP), nonlinear programming (NLP), mixed integer programming (MIP), and mixed integer nonlinear programming (MINLP) are supported

Dhrystone (1,017 words) [view diff] no match in snippet view article find links to article

by Reinhold P. Weicker intended to be representative of system (integer) programming. The Dhrystone grew to become representative of general processor

MPS (format) (1,497 words) [view diff] exact match in snippet view article

format for presenting and archiving linear programming (LP) and mixed integer programming problems. The format was named after an early IBM LP product and

Comparison of optimization software (371 words) [view diff] exact match in snippet view article find links to article

large-scale solvers for linear, quadratic, nonlinear, and mixed integer programming (LP, QP, NLP, MILP, MINLP). Modes of operation include parameter

Manfred W. Padberg (274 words) [view diff] case mismatch in snippet view article find links to article

advisor was Egon Balas and his dissertation was titled Essays in Integer Programming. Afterwards he worked from 1971 to 1974 at the Berlin Science Center

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

Mixed Integer Programming for Portfolio Optimization Alves, C., Clautiaux, F., de Carvalho, J.V., Rietz, J. - Dual-Feasible Functions for Integer Programming

FICO Xpress (584 words) [view diff] exact match in snippet view article find links to article

further implements a primal-dual hybrid gradient algorithm. All mixed integer programming variants as well as nonconvex continuous problems are solved by a

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

Integer Programming. John Wiley & Sons. pp. 88–89. ISBN 9780471982326. Conforti, Michele; Cornuejols, Gerard; Zambelli, Giacomo (2014-11-15). Integer

Linear programming relaxation (2,414 words) [view diff] exact match in snippet view article find links to article

relaxation technique transforms an NP-hard optimization problem (integer programming) into a related problem that is solvable in polynomial time (linear

Michel Balinski (2,369 words) [view diff] exact match in snippet view article find links to article

Neumann's model of an expanding economy are marginal values. His work in integer programming includes the formulation and analysis of the fixed cost transportation

Zuse Institute Berlin (453 words) [view diff] exact match in snippet view article find links to article

of the ZIB. SCIP (Solving Constraint Integer Programs) is a mixed integer programming solver and a framework for branch and cut and branch and price, developed

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

Frederick W. Lanchester Prize in 1986 for his book Theory of Linear and Integer Programming, and again in 2004 for his book Combinatorial Optimization: Polyhedra

M. Grazia Speranza (1,715 words) [view diff] exact match in snippet view article find links to article

routing have been the key areas of her scientific endeavor. Mixed integer programming models, computational complexity, worst-case analysis, exact (branch-and-cut

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

Operations Research Letters. Nemhauser's research concerns large mixed integer programming problems and their applications. He is one of the co-inventors of

Valley Metal Container (73 words) [view diff] exact match in snippet view article find links to article

production lines. Using mixed-integer programming to reduce label changes in the Coors aluminium can plant Using Mixed-Integer Programming to Reduce Label Changes

Gekko (optimization software) (1,988 words) [view diff] exact match in snippet view article

constrained quadratic program (QCQP), Nonlinear programming (NLP), Mixed integer programming (MIP), and Mixed integer linear programming (MILP). GEKKO is available

Quadratically constrained quadratic program (748 words) [view diff] exact match in snippet view article find links to article

formulated as a quadratically constrained quadratic program. Since 0–1 integer programming is NP-hard in general, QCQP is also NP-hard. However, even for a

Constraint satisfaction problem (3,363 words) [view diff] exact match in snippet view article find links to article

satisfiability problem (SAT), satisfiability modulo theories (SMT), mixed integer programming (MIP) and answer set programming (ASP) are all fields of research

Perfect matrix (160 words) [view diff] case mismatch in snippet view article find links to article

&0&0&1&1\\1&0&0&0&1\end{bmatrix}}.} D. M. Ryan, B. A. Foster, An Integer Programming Approach to Scheduling, p.274, University of Auckland, 1981. v t

Unimodular matrix (1,877 words) [view diff] case mismatch in snippet view article find links to article

Points of Convex Polyhedra", in M. Jünger; et al. (eds.), 50 Years of Integer Programming, 1958-2008, Springer-Verlag, pp. 49–50 Heller, I.; Tompkins, C.B

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

resembles branch-and-bound, which is now the standard method for solving integer programming problems. With the German mathematician Helmut Wielandt, Hoffman

Threshold graph (817 words) [view diff] exact match in snippet view article find links to article

inequalities in integer programming", in Hammer, P. L.; Johnson, E. L.; Korte, B. H.; et al. (eds.), Studies in Integer Programming (Proc. Worksh. Bonn

Jack Edmonds (1,543 words) [view diff] case mismatch in snippet view article find links to article

submodular functions on graphs", Studies in Integer Programming | Proceedings Workshop on Integer Programming, Bonn, 1975, Annals of Discrete Mathematics

AIMMS (1,253 words) [view diff] exact match in snippet view article find links to article

Linear programming Quadratic programming Nonlinear programming Mixed-integer programming Mixed-integer nonlinear programming Global optimization Complementarity

Selmer M. Johnson (502 words) [view diff] case mismatch in snippet view article find links to article

William (2009), "The birth of the cutting-plane method", 50 Years of Integer Programming 1958-2008: From the Early Years to the State-of-the-Art, Springer

Jon Lee (mathematician) (413 words) [view diff] case mismatch in snippet view article

Integer Programming and Combinatorial Optimization (Lecture Notes in Computer Science, Vol. 8494; Springer, 2014), Special Issue: Integer Programming

Fred W. Glover (1,267 words) [view diff] exact match in snippet view article find links to article

paths for integer programming and links to artificial intelligence". Computers & Operations Research. Applications of Integer Programming. 13 (5): 533–549

Power system simulation (2,863 words) [view diff] exact match in snippet view article find links to article

techniques such linear programming, quadratic programming, and mixed integer programming. Multiple elements of a power system can be modelled. A power-flow

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

music using a myriad of different optimization methods, including integer programming, variable neighbourhood search, and evolutionary methods as mentioned

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

Satisfiability-solvers to efficiently solve biological problems where integer programming was not effective. His fifth book was published by Cambridge Press

Renata Mansini (208 words) [view diff] case mismatch in snippet view article find links to article

Włodzimierz Ogryczak and M. Grazia Speranza, of the book Linear and Mixed Integer Programming for Portfolio Optimization (EURO Advanced Tutorials on Operational

JuMP (399 words) [view diff] exact match in snippet view article find links to article

metaprogramming features. JuMP supports linear programming, mixed integer programming, semidefinite programming, conic optimization, nonlinear programming

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

Finalists: Amitabh Basu and Guanghui Lan 2015: Daniel Dadush for "Integer Programming, Lattice Algorithms, and Deterministic Volume Computation". Other

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

and games". Proceedings of the 15th International Conference on Integer Programming and Combinatorial Optimization (IPCO). pp. 192–206. Disser, Y.; Hopp

GNU MathProg (620 words) [view diff] exact match in snippet view article find links to article

designed for creating and solving linear programming (LP), mixed integer programming (MIP), and other related optimisation problems. It is a subset of

Lp solve (258 words) [view diff] exact match in snippet view article find links to article

line utility and library for solving linear programming and mixed integer programming problems. It ships with support for two file formats, MPS and lp_solve's

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

Helen Makower and George Morton in the late 1950s on a number of integer programming problems. This included her early investigations of the travelling

Artelys Knitro (567 words) [view diff] exact match in snippet view article find links to article

and nonlinear) with binary or integer variables. The Knitro mixed integer programming (MIP) code offers three algorithms for mixed-integer nonlinear programming

Karp's 21 NP-complete problems (491 words) [view diff] exact match in snippet view article find links to article

formulas in conjunctive normal form (often referred to as SAT) 0–1 integer programming (A variation in which only the restrictions must be satisfied, with

Shakashaka (199 words) [view diff] exact match in snippet view article find links to article

Uehara, Ryuhei; Uno, Yushi (2014), "Computational complexity and an integer programming model of Shakashaka", IEICE Transactions on Fundamentals of Electronics

Doignon's theorem (655 words) [view diff] exact match in snippet view article find links to article

both rediscovered it in 1977 and pointed out its applications to integer programming. The result is tight: there exist systems of half-spaces for which

Peg solitaire (3,056 words) [view diff] exact match in snippet view article find links to article

(2001), "Integer Programming Based Algorithms for Peg Solitaire Problems", Proc. 2nd Int. Conf. Computers and Games (CG 2000): Integer programming based

Algorithm selection (1,836 words) [view diff] exact match in snippet view article find links to article

P {\displaystyle {\mathcal {NP}}} -hard problems (such as mixed integer programming, CSP, AI planning, TSP, MAXSAT, QBF and answer set programming).

Kenneth L. Clarkson (543 words) [view diff] exact match in snippet view article find links to article

Clarkson, Kenneth L. (1995), "Las Vegas algorithms for linear and integer programming when the dimension is small", Journal of the ACM, 42 (2): 488–499

Kenneth L. Clarkson (543 words) [view diff] exact match in snippet view article find links to article

Clarkson, Kenneth L. (1995), "Las Vegas algorithms for linear and integer programming when the dimension is small", Journal of the ACM, 42 (2): 488–499

ECLiPSe (755 words) [view diff] exact match in snippet view article find links to article

particular the COIN-OR, CPLEX, Gurobi, and Xpress-MP linear and mixed-integer programming solvers, and the Gecode solver library. Compatibility libraries for

Universal vertex (1,942 words) [view diff] exact match in snippet view article find links to article

inequalities in integer programming", in Hammer, P. L.; Johnson, E. L.; Korte, B. H.; Nemhauser, G. L. (eds.), Studies in Integer Programming (Proc. Worksh

Dantzig–Wolfe decomposition (891 words) [view diff] exact match in snippet view article find links to article

"Simplex algorithms". In J. E. Beasley (ed.). Advances in linear and integer programming. Oxford Science. pp. 1–46. MR 1438309. Maros, István (2003). Computational

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

Pochet, Yves, and Laurence A. Wolsey. Production planning by mixed integer programming. Springer, 2006. Antoon Kolen at the Mathematics Genealogy Project

Multiple sequence alignment (6,213 words) [view diff] exact match in snippet view article find links to article

Simulated Annealing). Mathematical programming and in particular mixed integer programming models are another approach to solve MSA problems. The advantage

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

Dover. (computer science) Alexander Schrijver, Theory of Linear and Integer Programming. John Wiley & sons, 1998, ISBN 0-471-98232-6 (mathematical) Michael

Still life (cellular automaton) (1,177 words) [view diff] exact match in snippet view article

2 - from LifeWiki". Retrieved 2024-07-11. Bosch, R. A. (1999). "Integer programming and Conway's game of Life". SIAM Review. 41 (3): 594–604. Bibcode:1999SIAMR

Martin Beale (773 words) [view diff] exact match in snippet view article find links to article

J. H.; Tomlin, J. A. (2006). "Branch and bound, integer, and non-integer programming". Annals of Operations Research. 149: 81–87. doi:10.1007/s10479-006-0112-x

Structure-based assignment (434 words) [view diff] exact match in snippet view article find links to article

B. R. (2010), "NVR-BIP: nuclear vector replacement using binary integer programming for NMR structure-based assignments", The Computer Journal, 54 (January):

Parametric programming (912 words) [view diff] exact match in snippet view article find links to article

present, then the problem is referred to as (multi)parametric mixed-integer programming problem If constraints are affine, then additional classifications

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

Chain Management". In Bienstock, Daniel; Nemhauser, George (eds.). Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science

Vijay Chandru (304 words) [view diff] case mismatch in snippet view article find links to article

Purdue University Thesis Complexity of the Super-Group Approach to Integer Programming (1982) Doctoral advisor Jeremy Frank Shapiro Website be.iisc.ac

Fulkerson Prize (1,965 words) [view diff] exact match in snippet view article find links to article

(4): 319–325. doi:10.1007/bf02579452. Lenstra, H. W. Jr. (1983). "Integer programming with a fixed number of variables". Mathematics of Operations Research

T. C. Hu (727 words) [view diff] case mismatch in snippet view article find links to article

Physical Design commemorated his contributions to the field. Reviews of Integer Programming and Network Flows: Ellis Johnson, Bulletin of the AMS, doi:10

Wolf, goat and cabbage problem (1,279 words) [view diff] case mismatch in snippet view article find links to article

Routledge & Kegan Paul. pp. 4–5. Alcuin's Transportation Problems and Integer Programming Archived 2011-07-19 at the Wayback Machine, Ralf Borndörfer, Martin

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

ISBN 9780262590204. Schrijver, Alexander (1998), Theory of Linear and Integer Programming, Wiley Series in Discrete Mathematics & Optimization, John Wiley

Stan van Hoesel (529 words) [view diff] exact match in snippet view article find links to article

Pochet, Yves, and Laurence A. Wolsey. Production planning by mixed integer programming. Springer, 2006. "Inauguratie Prof.dr.ir. C.P.M. van Hoesel UM Besliskunde

Prabhakar Raghavan (1,135 words) [view diff] case mismatch in snippet view article find links to article

Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems (Integer Programming) (1987) Doctoral advisor Clark D. Thompson

Dana Tomlin (638 words) [view diff] case mismatch in snippet view article find links to article

2005, pp. 17-32. Shirabe, Takesha; C. Dana Tomlin. Decomposing Integer Programming Models for Spatial Allocation[permanent dead link], in Geographic

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

min-max relation for submodular functions on graphs", Studies in integer programming (Proc. Workshop, Bonn, 1975), Annals of Discrete Mathematics, vol

Balanced matrix (868 words) [view diff] case mismatch in snippet view article find links to article

S2CID 41468611. Alexander Schrijver (1998). Theory of Linear and Integer Programming. John Wiley & Sons. pp. 303–308. ISBN 978-0-471-98232-6. Hoffman

SAMPL (867 words) [view diff] exact match in snippet view article find links to article

software for solving large-scale sparse linear programming (LP), mixed-integer programming (MIP) and quadratic programming (QP) models MPS (format) Robust optimization

Argonne National Laboratory (3,619 words) [view diff] exact match in snippet view article find links to article

science, and engineering. Included are state-of-the-art solvers in integer programming, nonlinear optimization, linear programming, stochastic programming

Robust fuzzy programming (816 words) [view diff] exact match in snippet view article find links to article

Li, Y.P.; Huang, G.H. (2015-12-15). "A robust possibilistic mixed-integer programming method for planning municipal electric power systems". International

Portfolio optimization (2,702 words) [view diff] exact match in snippet view article find links to article

Linear programming Quadratic programming Nonlinear programming Mixed integer programming Meta-heuristic methods Stochastic programming for multistage portfolio

Hrishikesh Vinod (1,061 words) [view diff] exact match in snippet view article find links to article

Vinod was the first to solve the optimal clustering problems with integer programming and use inventory theoretic demand analysis. In 1976, he invented

William Baumol (2,419 words) [view diff] case mismatch in snippet view article find links to article

Ordinal", 1958, EJ. Business Behavior, Value and Growth, 1959. "Integer Programming and Pricing", with R.E. Gomory, 1960, Econometrica. Economic Theory

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

Diophantine equations are basic in this context, and textbooks on integer programming usually have a treatment of systems of linear Diophantine equations

Graduate Texts in Mathematics (5,056 words) [view diff] case mismatch in snippet view article find links to article

Algebraic Topology, Steven Weintraub, (2014, ISBN 978-1-4939-1843-0) Integer Programming, Michelangelo Conforti, Gérard P. Cornuéjols, Giacomo Zambelli, (2014

Job-shop scheduling (2,578 words) [view diff] exact match in snippet view article find links to article

example of a job-shop scheduling problem formulated in AMPL as a mixed-integer programming problem with indicator constraints: param N_JOBS; param N_MACHINES;

Eric Feron (272 words) [view diff] exact match in snippet view article find links to article

Dynamics 25.1 (2002): 116–129. Schouwenaars, Tom, et al. "Mixed integer programming for multi-vehicle path planning." 2001 European control conference

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

Pochet, Yves, and Laurence A. Wolsey. Production planning by mixed integer programming. Springer, 2006. Albert P. M. Wagelmans at the Mathematics Genealogy

Lemke–Howson algorithm (1,391 words) [view diff] exact match in snippet view article find links to article

Thomas; Gilpin, Andrew; Conitzer, Vincent (9 July 2005). "Mixed-integer programming methods for finding Nash equilibria" (PDF). Proceedings of the 20th

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

(2001). "Bounds for Deterministic Periodic Routing sequences". Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science

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

(2001). "Bounds for Deterministic Periodic Routing sequences". Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science

Quadratic knapsack problem (3,911 words) [view diff] case mismatch in snippet view article find links to article

relaxations using cutting planes and semidefinite programming". Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science

Parsimonious reduction (1,084 words) [view diff] exact match in snippet view article find links to article

CiteSeerX 10.1.1.81.7891. "JAIST Repository: Computational complexity and an integer programming model of Shakashaka". dspace.jaist.ac.jp. Retrieved 2019-05-15.

List of knapsack problems (1,082 words) [view diff] exact match in snippet view article find links to article

(link) Lueker, G.S. (1975). Two NP-complete problems in nonnegative integer programming. Report No. 178, Computer Science Laboratory, Princeton. Gens, G

List of RNA structure prediction software (8,455 words) [view diff] exact match in snippet view article find links to article

accurate prediction of RNA secondary structures with pseudoknots using integer programming". Bioinformatics. 27 (13): i85 – i93. doi:10.1093/bioinformatics/btr215

Tamás Terlaky (1,595 words) [view diff] exact match in snippet view article find links to article

interior point methods". In J. E. Beasley (ed.). Advances in linear and integer programming. Oxford Lecture Series in Mathematics and its Applications. Vol. 4

Boolean satisfiability problem (5,045 words) [view diff] exact match in snippet view article find links to article

first- and second-order logic, constraint satisfaction problems, 0-1 integer programming. While SAT is a decision problem, the search problem of finding a

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

based on pairwise comparison of hidden Markov models. RAPTOR is an integer programming based protein threading software. It has been replaced by a new protein

Optimizing compiler (5,417 words) [view diff] case mismatch in snippet view article find links to article

15: NP-completeness, Optimization and Separation" (PDF). IE 511: Integer Programming, Spring 2021. Aho, Alfred V.; Sethi, Ravi; Ullman, Jeffrey D. (1986)

Board puzzles with algebra of binary variables (1,647 words) [view diff] case mismatch in snippet view article find links to article

(Springer-Verlag edition). Alexander Schrijver, Theory of Linear and Integer Programming. John Wiley & Sons, 1986. Reprinted in 1999. ISBN 0-471-98232-6.

Submodular flow (352 words) [view diff] exact match in snippet view article find links to article

min-max relation for submodular functions on graphs", Studies in integer programming (Proc. Workshop, Bonn, 1975), Annals of Discrete Mathematics, vol

Janny Leung (465 words) [view diff] exact match in snippet view article find links to article

to INFORMS, and theoretical and applied research contributions to integer programming, transportation and logistics". She is also a founding fellow of

Outline of finance (5,705 words) [view diff] exact match in snippet view article find links to article

Quadratic programming Critical line method Nonlinear programming Mixed integer programming Stochastic programming (§ Multistage portfolio optimization) Copula

Dijoin (626 words) [view diff] exact match in snippet view article find links to article

min-max relation for submodular functions on graphs", Studies in integer programming (Proc. Workshop, Bonn, 1975), Annals of Discrete Mathematics, vol

G. Anthony Gorry (384 words) [view diff] exact match in snippet view article find links to article

, & Wolsey, L. A. (1972). Relaxation methods for pure and mixed integer programming problems. Management Science, 18(5-part-1), 229-239. Gorry, G. A

Local search (constraint satisfaction) (1,472 words) [view diff] exact match in snippet view article

Benchmarks of Model RB Glover, Fred (January 1986). "Future paths for integer programming and links to artificial intelligence". Computers & Operations Research

Dicut (588 words) [view diff] exact match in snippet view article find links to article

min-max relation for submodular functions on graphs", Studies in integer programming (Proc. Workshop, Bonn, 1975), Annals of Discrete Mathematics, vol

Constrained conditional model (1,502 words) [view diff] case mismatch in snippet view article find links to article

"Joint Determination of Anaphoricity and Coreference Resolution using Integer Programming." Archived 2010-06-21 at the Wayback Machine NAACL-HLT, (2007). James

Aztec diamond (1,766 words) [view diff] exact match in snippet view article find links to article

holes in the covering). This formulation can be solved with standard integer programming packages. Additional constraints can be constructed to force placement

Lattice problem (3,660 words) [view diff] exact match in snippet view article find links to article

Mathematics, Netherlands. Kannan, Ravi (1983). "Improved algorithms for integer programming and related lattice problems". Proceedings of the fifteenth annual

Eva K. Lee (4,458 words) [view diff] exact match in snippet view article find links to article

affiliation, see e.g. Gallagher, R. J.; Lee, E. K. (1997), "Mixed integer programming optimization models for brachytherapy treatment planning", Proceedings

List of phylogenetics software (2,449 words) [view diff] case mismatch in snippet view article find links to article

Inference in Tumors Using Phylogeny Exhaustive search, Quadratic Integer Programming (QIP) S. Malikic, A.W. McPherson, N. Donmez, C.S. Sahinalp ClustalW

Energy modeling (4,269 words) [view diff] exact match in snippet view article find links to article

operations research. Most rely on linear programming (including mixed-integer programming), although some use nonlinear programming. Solvers may use classical

Sheldon H. Jacobson (1,883 words) [view diff] case mismatch in snippet view article find links to article

Sewell, Edward C.; Deuson, Robert; Weniger, Bruce G. (1999). "An Integer Programming Model for Vaccine Procurement and Delivery for Childhood Immunization:

Knapsack problem (7,799 words) [view diff] case mismatch in snippet view article find links to article

February 2015 at the Wayback Machine Optimizing Three-Dimensional Bin Packing Knapsack Integer Programming Solution in Python Gekko (optimization software)

Mathematical economics (10,736 words) [view diff] case mismatch in snippet view article find links to article

Company. pp. xviii+277. Alexander Schrijver, Theory of Linear and Integer Programming. John Wiley & sons, 1998, ISBN 0-471-98232-6. Rockafellar, R. Tyrrell

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

algorithms for finding a minimum cycle basis in undirected graphs", Integer Programming and Combinatorial Optimization: 14th International Conference, IPCO

Aquaculture of salmonids (10,396 words) [view diff] exact match in snippet view article find links to article

poultry, multi-species aquaculture for Malaysian rice farmers: A mixed integer programming approach". Agricultural Systems. 32 (3): 207–231. Bibcode:1990AgSys

Planar SAT (2,162 words) [view diff] exact match in snippet view article find links to article

Uehara, Ryuhei; Uno, Yushi (2014), "Computational complexity and an integer programming model of Shakashaka" (PDF), IEICE Transactions on Fundamentals of

Comparative genomics (8,127 words) [view diff] exact match in snippet view article find links to article

"Screening synteny blocks in pairwise genome comparisons through integer programming". BMC Bioinformatics. 12: 102. doi:10.1186/1471-2105-12-102. PMC 3088904

Barnett critique (1,256 words) [view diff] case mismatch in snippet view article find links to article

ISSN 1538-4616. Hjertstrand, P.; Swofford, J. L.; Whitney, G. (2016). "Mixed Integer Programming Revealed Preference Tests of Utility Maximization and Weak Separability

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

problem as an integer program and describe their experience using an integer programming solver to edge color graphs. However, they did not perform any complexity

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

in Lodi, Andrea; Panconesi, Alessandro; Rinaldi, Giovanni (eds.), Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO

Demand flow technology (3,081 words) [view diff] exact match in snippet view article find links to article

requirements planning, The Journal of Operations Management. Pochet, Yves. Wolsey, Laurence A. (2000). Production planning by mixed integer programming.

Multiplicative weight update method (3,696 words) [view diff] exact match in snippet view article find links to article

152. Kenneth L. Clarkson. A Las Vegas algorithm for linear and integer programming when the dimension is small., Journal of the ACM, 42:488–499, 1995

Multi-agent pathfinding (3,140 words) [view diff] case mismatch in snippet view article find links to article

then solved using specific constraint solvers such as SAT and Mixed Integer Programming (MIP) solvers. Bounded suboptimal algorithms offer a trade-off between

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

Foundation Grant GJ-43227X", Annals of Discrete Mathematics, Studies in Integer Programming, vol. 1, Elsevier, pp. 331–342, doi:10.1016/S0167-5060(08)70742-8

LP-type problem (4,687 words) [view diff] exact match in snippet view article find links to article

Clarkson, Kenneth L. (1995), "Las Vegas algorithms for linear and integer programming when the dimension is small" (PDF), Journal of the ACM, 42 (2): 488–499

List of numerical analysis topics (8,335 words) [view diff] exact match in snippet view article find links to article

optimization Discrete optimization Linear programming (also treats integer programming) — objective function and constraints are linear Algorithms for linear

2-satisfiability (9,112 words) [view diff] case mismatch in snippet view article find links to article

Problems", Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization, Springer-Verlag, pp. 67–82, ISBN 978-3-540-43676-8

Open energy system models (24,170 words) [view diff] exact match in snippet view article find links to article

OSeMOSYS uses pure linear optimization, with the option of mixed integer programming for the treatment of, for instance, discrete power plant capacity