Outline of an algorithm for integer solutions to linear programs
From MaRDI portal
Publication:3256638
DOI10.1090/S0002-9904-1958-10224-4zbMath0085.35807WikidataQ30053163 ScholiaQ30053163MaRDI QIDQ3256638
Publication date: 1958
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
Unnamed Item, Polyhedral techniques in combinatorial optimization I: Theory, The Complexity of Propositional Proofs, A model for discrete-variable linear programming, On some sequencing problems, Rückgerechnete Duale Variable, Classical cuts for mixed-integer programming and branch-and-cut, Branch and cut methods for network optimization, Elementary closures for integer programs., Cutting planes in integer and mixed integer programming, Large-scale 0-1 linear programming on distributed workstations, An implicit branch-and-bound algorithm for mixed-integer linear programming, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems, Logical processing for integer programming, Mixed-integer cuts from cyclic groups, An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane, Optimizing over the first Chvátal closure, The mixing-MIR set with divisible capacities, The stable set polytope of quasi-line graphs, George Dantzig's contributions to integer programming, George Dantzig's impact on the theory of computation, A finitely converging cutting plane technique, Cutting planes in combinatorics, Polyhedral proof methods in combinatorial optimization, Solution approaches for highly primal- and dual-degenerate all-integer programming problems, An advanced start algorithm for all-integer programming, A simple strategy for solving a class of 0-1 integer programming models, The mixed cutting plane algorithm for all-integer programming, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, On cutting-plane proofs in combinatorial optimization, Submodularity and the traveling salesman problem, Comments on practical implementation of Gomory's fractional algorithm, Parametric integer linear programming: A synthesis of branch and bound with cutting planes, On surrogating 0-1 knapsack constraints, A primal dual integer programming algorithm, Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts, Solving \(0/1\) integer programs with enumeration cutting planes, Rational and integral \(k\)-regular matrices., Optimal project selection when borrowing and lending rates differ, Strengthening Chvátal-Gomory cuts and Gomory fractional cuts, Efficient reformulation for 0-1 programs -- methods and computational results, \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates, The application of valid inequalities to the multi-stage lot-sizing problem, MIPping closures: An instant survey, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Solving 0-1 programming problems by a penalty approach., Projected Chvátal-Gomory cuts for mixed integer linear programs, A constraint generation algorithm for large scale linear programs using multiple-points separation, Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), Theory of majority decision elements, A duality theorem and an algorithm for (mixed-) integer nonlinear programming, An outline of linear programming, Gomory cuts revisited, The allocation of shared fixed costs, An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs, Matrices of rational integers, Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme, Bemerkungen zum Verfahren vonGomory zur Bestimmung ganzzahliger Lösungen von linearen Programmen, Spherical cuts for integer programming problems, Resolution Width and Cutting Plane Rank Are Incomparable, Polyhedral Combinatorics in Combinatorial Optimization
Cites Work
