Pages that link to "Item:Q3256638"

The following pages link to Outline of an algorithm for integer solutions to linear programs (Q3256638):

Displayed 50 items.

• Cutting planes in integer and mixed integer programming (Q697578) ‎ (← links)
• Large-scale 0-1 linear programming on distributed workstations (Q750295) ‎ (← links)
• An implicit branch-and-bound algorithm for mixed-integer linear programming (Q804472) ‎ (← links)
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) ‎ (← links)
• Logical processing for integer programming (Q817209) ‎ (← links)
• Mixed-integer cuts from cyclic groups (Q868450) ‎ (← links)
• An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane (Q870164) ‎ (← links)
• Optimizing over the first Chvátal closure (Q877190) ‎ (← links)
• The mixing-MIR set with divisible capacities (Q930344) ‎ (← links)
• The stable set polytope of quasi-line graphs (Q949780) ‎ (← links)
• George Dantzig's contributions to integer programming (Q951090) ‎ (← links)
• George Dantzig's impact on the theory of computation (Q951091) ‎ (← links)
• A finitely converging cutting plane technique (Q1060961) ‎ (← links)
• Cutting planes in combinatorics (Q1068092) ‎ (← links)
• Polyhedral proof methods in combinatorial optimization (Q1082268) ‎ (← links)
• Solution approaches for highly primal- and dual-degenerate all-integer programming problems (Q1085064) ‎ (← links)
• An advanced start algorithm for all-integer programming (Q1086158) ‎ (← links)
• A simple strategy for solving a class of 0-1 integer programming models (Q1090232) ‎ (← links)
• The mixed cutting plane algorithm for all-integer programming (Q1092815) ‎ (← links)
• A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) ‎ (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) ‎ (← links)
• Submodularity and the traveling salesman problem (Q1124707) ‎ (← links)
• Comments on practical implementation of Gomory's fractional algorithm (Q1134628) ‎ (← links)
• Parametric integer linear programming: A synthesis of branch and bound with cutting planes (Q1162446) ‎ (← links)
• On surrogating 0-1 knapsack constraints (Q1304781) ‎ (← links)
• A primal dual integer programming algorithm (Q1309813) ‎ (← links)
• Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) ‎ (← links)
• Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) ‎ (← links)
• Rational and integral \(k\)-regular matrices. (Q1420582) ‎ (← links)
• Optimal project selection when borrowing and lending rates differ (Q1596890) ‎ (← links)
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts (Q1612007) ‎ (← links)
• Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) ‎ (← links)
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates (Q1804563) ‎ (← links)
• The application of valid inequalities to the multi-stage lot-sizing problem (Q1894735) ‎ (← links)
• MIPping closures: An instant survey (Q2373443) ‎ (← links)
• Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) ‎ (← links)
• Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) ‎ (← links)
• Solving 0-1 programming problems by a penalty approach. (Q2468556) ‎ (← links)
• Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) ‎ (← links)
• A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) ‎ (← links)
• Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988) ‎ (← links)
• Theory of majority decision elements (Q2539620) ‎ (← links)
• A duality theorem and an algorithm for (mixed-) integer nonlinear programming (Q2548914) ‎ (← links)
• An outline of linear programming (Q2555451) ‎ (← links)
• Gomory cuts revisited (Q2564234) ‎ (← links)
• The allocation of shared fixed costs (Q2572246) ‎ (← links)
• An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) ‎ (← links)
• Matrices of rational integers (Q3277523) ‎ (← links)
• Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme (Q3284266) ‎ (← links)
• Bemerkungen zum Verfahren vonGomory zur Bestimmung ganzzahliger Lösungen von linearen Programmen (Q3288562) ‎ (← links)