Solving Mixed Integer Programming Problems Using Automatic Reformulation
From MaRDI portal
Publication:4723573
DOI10.1287/opre.35.1.45zbMath0614.90082OpenAlexW2028498002MaRDI QIDQ4723573
Laurence A. Wolsey, Tony J. van Roy
Publication date: 1987
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.35.1.45
Related Items
Valid inequalities for mixed 0-1 programs, Implicit cover inequalities, The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron, On the complexity of sequentially lifting cover inequalities for the knapsack polytope, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks, Supernode processing of mixed-integer models, The application of valid inequalities to the multi-stage lot-sizing problem, Separation algorithms for 0-1 knapsack polytopes, An algorithm for solving fixed-charge problems using surrogate constraints, Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints, S3 sets. An extension of the Beale-Tomlin special ordered sets, Valid inequalities and separation for capacitated economic lot sizing, Strategies for LP-based solving a general class of scheduling problems, A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, The complementary class of generalized flow cover inequalities, On optimizing over lift-and-project closures, Lot-size models with backlogging: Strong reformulations and cutting planes, A binary integer linear program with multi-criteria and multi-constraint levels, An efficient integer programming model of the dynamic lot-sizing problem, The integer linear complementarity problem, Strong formulations for mixed integer programming: A survey, Long range planning in the process industries: A projection approach, \(O(n \log n)\) procedures for tightening cover inequalities, An efficient linearization technique for mixed 0-1 polynomial problem, Optimality-based domain reduction for inequality-constrained NLP and MINLP problems, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach, Solving mixed integer programming production planning problems with setups by shadow price information., Domain reduction techniques for global NLP and MINLP optimization, Fixed-charge transportation on a path: optimization, LP formulations and separation, A production planning problem in FMS, Valid inequalities and separation for capacitated fixed charge flow problems, Generating cuts in integer programming with families of special ordered sets, Linear complementarity problems solvable by integer programming, Preprocessing and cutting for multiple allocation hub location problems., Fixed-charge transportation problems on trees, Finding minimum cost directed trees with demands and capacities, Classical cuts for mixed-integer programming and branch-and-cut, Fixed-Charge Transportation on a Path: Linear Programming Formulations, An approximate method for local optima for nonlinear mixed integer programming problems, Mixed integer programming: A historical perspective with Xpress-MP, Unnamed Item, Cutting planes in integer and mixed integer programming, Branch and cut methods for network optimization, Flow pack facets of the single node fixed-charge flow polytope, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, Preprocessing and cutting planes with conflict graphs, Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem, Optimization algorithms for the disjunctively constrained knapsack problem, Reformulations in Mathematical Programming: Definitions and Systematics, New valid inequalities for the fixed-charge and single-node flow polytopes, 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, Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems, Scheduling of a constellation of satellites: creating a mixed-integer linear model, The teacher assignment problem: A special case of the fixed charge transportation problem, Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds, Optimum Solution of the Closest String Problem via Rank Distance, Capacitated facility location: Separation algorithms and computational experience, A linearization method for mixed 0--1 polynomial programs, Different transformations for solving non-convex trim-loss problems by MINLP, Gomory cuts revisited, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, A study of integer programming formulations for scheduling problems, A production and maintenance planning model for the process industry, Valid inequalities and separation for uncapacitated fixed charge networks, Logic cuts for processing networks with fixed charges, Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems, Optimal competence set expansion using deduction graphs, A cutting plane method for solving harvest scheduling models with area restrictions, Integer-programming software systems
Uses Software
