ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
From MaRDI portal
Publication:5341335
DOI10.1073/pnas.53.2.260zbMath0132.13702OpenAlexW2046076510WikidataQ36373614 ScholiaQ36373614MaRDI QIDQ5341335
Publication date: 1965
Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1073/pnas.53.2.260
Related Items
The Integrality Number of an Integer Program, Representability in mixed integer programming. I: Characterization results, On integer programming with bounded determinants, The width and integer optimization on simplices with bounded minors of the constraint matrices, Enumerating Integer Points in Polytopes with Bounded Subdeterminants, General purpose heuristics for integer programming. I, On lattice point counting in \(\varDelta\)-modular polyhedra, The Gap Function: Evaluating Integer Programming Models over Multiple Right-Hand Sides, Polyhedra of regular p-nary group problems, Parametric formulation of the general integer linear programming problem, On cutting-plane proofs in combinatorial optimization, Discrete subadditive functions as Gomory functions, A number theoretic reformulation and decomposition method for integer programming, Evaluating mixed-integer programming models over multiple right-hand sides, Optimal Cutting Planes from the Group Relaxations, Dual row modules and polyhedra of blocking group problems, Coefficient reduction for inequalities in 0–1 variables, The b-hull of an integer program, On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems, Generation of all integer points for given sets of linear inequalities, Computational experience with a group theoretic integer programming algorithm, Brève communication. Programme en nombres entiers sans contraintes : génération des optimums locaux dans le cas quadratique, Integer programming and convex analysis: Intersection cuts from outer polars, The Distributions of Functions Related to Parametric Integer Optimization, Sensitivity theorems in integer linear programming, Generalized dynamic programming methods in integer programming, On stochastic integer programming, Relaxations of mixed integer sets from lattice-free polyhedra, Approximate and exact merging of knapsack constraints with cover inequalities, Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations, Integer programs for logic constraint satisfaction, Integer programming as projection, FPT-algorithms for some problems related to integer programming, Some computationally relevant group theoretic structures of fixed charge problems, Modeling and algorithmic development of a staff scheduling problem, A solution method for a knapsack problem and its variant, Shortest path algorithms for knapsack type problems, Non-standard approaches to integer programming, Relaxations of mixed integer sets from lattice-free polyhedra, On the reduction of elementary bitisors of local cones-an aggregation-type approach, On the lattice programming gap of the group problems, The value function of a mixed integer program: I, Discrete right hand side parametrization for linear integer programs, Minimal inequalities, The strength of multi-row models, Local unimodularity of matrix-vector pairs, An extension of Hu's group minimization algorithm, Cutting-plane theory: Algebraic methods, Proximity bounds for random integer programs, An optimal control approach to nonlinear mixed integer programming problems, A dynamic programming solution to integer linear programs, Structural approach to parametric analysis of an IP. On the case of the right-hand side, Some polyhedra related to combinatorial problems, Faces of the Gomory polyhedron for cyclic groups, A relation between the knapsack and group knapsack problems, On the asymptotic integer algorithm, On the complexity of surrogate and group relaxation for integer linear programs, FPT-algorithm for computing the width of a simplex given by a convex hull, Transformation of integer programs to knapsack problems, Representability of functions, Edmonds polytopes and a hierarchy of combinatorial problems, Extreme point programming with nonlinear constraints, Polytopes of partitions of numbers, Standard pairs and group relaxations in integer programming, A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems, A geometric approach to cut-generating functions, The integrality number of an integer program, Totally tight Chvatal-Gomory cuts, Light on the infinite group relaxation. I: Foundations and taxonomy
