KnowraInteger programmingLinked fromLinked fromThe 22 pages that link to Integer programming, each with the reason it gives.All 22Broader topic 3Related 13Narrower topic 1Compared with 5IntegerBroader topic: Its restrictions use integers to model indivisible choices such as people or vehicles.Linear programmingCompared with: Discrete decisions violate the continuous-variable assumption of ordinary linear programming.Operations researchBroader topic: Whole-number choices such as staffing or facility locations require discrete variables.Convex optimizationCompared with: Discrete constraints generally destroy convexity and tractability.Constraint satisfaction problemRelated: It can encode many CSPs, but uses a narrower linear modeling language.PolyhedronRelated: Polyhedral relaxations bound and help solve problems with discrete variables.Combinatorial optimizationRelated: It expresses discrete choices as variables, constraints, and an objective function.Boolean satisfiability problemCompared with: SAT uses Boolean constraints, while integer programming expresses discrete choices through arithmetic constraints.Chromatic numberRelated: A binary-variable formulation can seek the fewest colors while enforcing different colors on adjacent vertices.Linear programming dualityCompared with: Its linear relaxation has a dual, but integrality can create a gap between primal and dual optima.Geometry of numbersRelated: Geometric methods for integer points inform bounds and algorithms for discrete optimization.NP-hardnessRelated: General integer programming is NP-hard, linking complexity theory to mathematical optimization.Mathematical optimizationBroader topic: It represents indivisible choices such as selecting projects or routes.Kidney exchangeRelated: Kidney exchange programs use it to choose feasible cycles and chains that maximize transplants.Shadow priceCompared with: Discrete decisions can make value changes jump discontinuously, so ordinary marginal prices may not exist.Vehicle routing problemRelated: Binary decisions can represent whether a vehicle travels between two locations.Linear programming relaxationNarrower topic: Its discrete feasible solutions are retained when integrality is removed to form a relaxation.Floor and ceiling functionsRelated: Floor and ceiling inequalities can express integer bounds and strengthen optimization formulations.Travelling salesman problemRelated: Binary edge variables encode selected roads, while constraints enforce a valid tour.Pick's theoremRelated: Lattice-point counts connect polygon geometry with feasible integer solutions.Optimal facility locationRelated: Binary site-selection variables encode whether a candidate facility is opened.Shapley–Folkman lemmaRelated: Convexification can relax discrete choices, while the lemma limits how many summands need remain nonconvex.
KnowraInteger programmingLinked fromLinked fromThe 22 pages that link to Integer programming, each with the reason it gives.All 22Broader topic 3Related 13Narrower topic 1Compared with 5IntegerBroader topic: Its restrictions use integers to model indivisible choices such as people or vehicles.Linear programmingCompared with: Discrete decisions violate the continuous-variable assumption of ordinary linear programming.Operations researchBroader topic: Whole-number choices such as staffing or facility locations require discrete variables.Convex optimizationCompared with: Discrete constraints generally destroy convexity and tractability.Constraint satisfaction problemRelated: It can encode many CSPs, but uses a narrower linear modeling language.PolyhedronRelated: Polyhedral relaxations bound and help solve problems with discrete variables.Combinatorial optimizationRelated: It expresses discrete choices as variables, constraints, and an objective function.Boolean satisfiability problemCompared with: SAT uses Boolean constraints, while integer programming expresses discrete choices through arithmetic constraints.Chromatic numberRelated: A binary-variable formulation can seek the fewest colors while enforcing different colors on adjacent vertices.Linear programming dualityCompared with: Its linear relaxation has a dual, but integrality can create a gap between primal and dual optima.Geometry of numbersRelated: Geometric methods for integer points inform bounds and algorithms for discrete optimization.NP-hardnessRelated: General integer programming is NP-hard, linking complexity theory to mathematical optimization.Mathematical optimizationBroader topic: It represents indivisible choices such as selecting projects or routes.Kidney exchangeRelated: Kidney exchange programs use it to choose feasible cycles and chains that maximize transplants.Shadow priceCompared with: Discrete decisions can make value changes jump discontinuously, so ordinary marginal prices may not exist.Vehicle routing problemRelated: Binary decisions can represent whether a vehicle travels between two locations.Linear programming relaxationNarrower topic: Its discrete feasible solutions are retained when integrality is removed to form a relaxation.Floor and ceiling functionsRelated: Floor and ceiling inequalities can express integer bounds and strengthen optimization formulations.Travelling salesman problemRelated: Binary edge variables encode selected roads, while constraints enforce a valid tour.Pick's theoremRelated: Lattice-point counts connect polygon geometry with feasible integer solutions.Optimal facility locationRelated: Binary site-selection variables encode whether a candidate facility is opened.Shapley–Folkman lemmaRelated: Convexification can relax discrete choices, while the lemma limits how many summands need remain nonconvex.