Solving Mixed Integer Programming Problems Using Automatic Reformulation
From MaRDI portal
DOI10.1287/OPRE.35.1.45zbMATH Open0614.90082OpenAlexW2028498002MaRDI QIDQ4723573FDOQ4723573
Authors: Tony J. van Roy, Laurence A. Wolsey 
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
Recommendations
Cited In (78)
- A study of integer programming formulations for scheduling problems
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- A cutting plane method for solving harvest scheduling models with area restrictions
- Capacitated facility location: Separation algorithms and computational experience
- An efficient integer programming model of the dynamic lot-sizing problem
- Implicit cover inequalities
- Mixed integer programming: A historical perspective with Xpress-MP
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps
- Valid inequalities and separation for uncapacitated fixed charge networks
- Coefficient strengthening: a tool for reformulating mixed-integer programs
- Valid inequalities and separation for capacitated fixed charge flow problems
- Title not available (Why is that?)
- Linear complementarity problems solvable by integer programming
- Integer-programming software systems
- \(O(n \log n)\) procedures for tightening cover inequalities
- Preprocessing and cutting for multiple allocation hub location problems.
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope
- Efficient reformulation for 0-1 programs -- methods and computational results
- A linearization method for mixed 0--1 polynomial programs
- Reformulations in Mathematical Programming: Definitions and Systematics
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
- Solving mixed integer programming production planning problems with setups by shadow price information.
- Long range planning in the process industries: A projection approach
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
- \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
- Different transformations for solving non-convex trim-loss problems by MINLP
- An efficient linearization technique for mixed 0-1 polynomial problem
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks
- Logic cuts for processing networks with fixed charges
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Optimal competence set expansion using deduction graphs
- Solving large-scale mixed-integer programs with fixed charge variables
- Valid inequalities and separation for capacitated economic lot sizing
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Gomory cuts revisited
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- Separation algorithms for 0-1 knapsack polytopes
- Flow pack facets of the single node fixed-charge flow polytope
- New valid inequalities for the fixed-charge and single-node flow polytopes
- Finding minimum cost directed trees with demands and capacities
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- Valid inequalities for mixed 0-1 programs
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- An approximate method for local optima for nonlinear mixed integer programming problems
- Branch and cut methods for network optimization
- The teacher assignment problem: A special case of the fixed charge transportation problem
- Cutting planes in integer and mixed integer programming
- The complementary class of generalized flow cover inequalities
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- A production planning problem in FMS
- Generating cuts in integer programming with families of special ordered sets
- An algorithm for solving fixed-charge problems using surrogate constraints
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- Supernode processing of mixed-integer models
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
- A binary integer linear program with multi-criteria and multi-constraint levels
- The application of valid inequalities to the multi-stage lot-sizing problem
- On optimizing over lift-and-project closures
- Fixed-charge transportation problems on trees
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Classical cuts for mixed-integer programming and branch-and-cut
- Strong formulations for mixed integer programming: A survey
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- Fixed-charge transportation on a path: linear programming formulations
- Quantifying the benefits of customized vaccination strategies: A network‐based optimization approach
- Strategies for LP-based solving a general class of scheduling problems
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem
- Fixed-charge transportation on a path: optimization, LP formulations and separation
- A production and maintenance planning model for the process industry
- Preprocessing and cutting planes with conflict graphs
- Optimum Solution of the Closest String Problem via Rank Distance
- Scheduling of a constellation of satellites: creating a mixed-integer linear model
- Optimization algorithms for the disjunctively constrained knapsack problem
- Domain reduction techniques for global NLP and MINLP optimization
- The integer linear complementarity problem
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables
Uses Software
This page was built for publication: Solving Mixed Integer Programming Problems Using Automatic Reformulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723573)
