Integer programming
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
known for
Wikipage disambiguates
APMonitorAlgebraic geometryAlgorithmAlgorithms for integer programmingAlison HarcourtApplications of integer programmingArc routingAutomatic label placementBalanced matrixBanner blindnessBayesian networkBend minimizationBin packing problemBranch and boundBranch and cutBranch and priceCOIN-ORCPLEXCenter for Operations Research and EconometricsChaotic hysteresisCoffman–Graham algorithmCombinatorial optimizationComputational complexity theoryCondorcet methodConstrained least squaresConstrained optimizationConstraint (mathematics)Continuous or discrete variableCovering problemsCramer's ruleCutting-plane methodCutting stock problemCycle basisDecoding methodsDiophantine equationDiscrete optimizationEdge coloringEfficient approximately-fair item allocationEgon BalasEllis L. Johnson
Link from a Wikipage to another Wikipage
known for
primaryTopic
Integer programming
An integer programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is NP-complete. In particular, the special case of 0-1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems.
has abstract
An integer programming problem ...... d-integer programming problem.
@en
Celočíselné programování je od ...... ování byla řešena v roce 1958.
@cs
Die ganzzahlige lineare Optimi ...... e Lösungsverfahren kombiniert.
@de
Een geheeltallig programmering ...... P-compleet problemen van Karp.
@nl
L'optimisation linéaire en nom ...... des techniques particulières.
@fr
La programació lineal entera s ...... ts s'obté el màxim o el mínim.
@ca
Um Problema de Programação Int ...... iros é um problema NP-difícil.
@pt
Un problema de programación en ...... problemas NP-completo de Karp.
@es
Задача целочисленного программ ...... й из 21 NP-полных задач Карпа.
@ru
Цілочисельне програмування — р ...... результату на цілочисельність.
@uk
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,024,880,803
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
isPartOf
subject
hypernym
type
comment
An integer programming problem ...... arp's 21 NP-complete problems.
@en
Celočíselné programování je od ...... ování byla řešena v roce 1958.
@cs
Die ganzzahlige lineare Optimi ...... der meist nicht genau bekannt,
@de
Een geheeltallig programmering ...... P-compleet problemen van Karp.
@nl
L'optimisation linéaire en nom ...... et par des variables entières.
@fr
La programació lineal entera s ...... assoleix el màxim o el mínim.
@ca
Um Problema de Programação Int ...... iros é um problema NP-difícil.
@pt
Un problema de programación en ...... problemas NP-completo de Karp.
@es
Задача целочисленного программ ...... й из 21 NP-полных задач Карпа.
@ru
Цілочисельне програмування — р ...... результату на цілочисельність.
@uk
label
Celočíselné programování
@cs
Ganzzahlige lineare Optimierung
@de
Geheeltallige programmering
@nl
Integer programming
@en
Optimisation linéaire en nombres entiers
@fr
Programació lineal entera
@ca
Programación en enteros
@es
Programação inteira
@pt
Целочисленное программирование
@ru
Цілочисельне програмування
@uk