Pages that link to "Item:Q4723573"
From MaRDI portal
The following pages link to Solving Mixed Integer Programming Problems Using Automatic Reformulation (Q4723573):
Displaying 50 items.
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- Implicit cover inequalities (Q266036) (← links)
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Integer-programming software systems (Q817202) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- A production planning problem in FMS (Q917423) (← links)
- Generating cuts in integer programming with families of special ordered sets (Q922293) (← links)
- Valid inequalities and separation for uncapacitated fixed charge networks (Q1064271) (← links)
- Valid inequalities for mixed 0-1 programs (Q1076609) (← links)
- S3 sets. An extension of the Beale-Tomlin special ordered sets (Q1102852) (← links)
- Valid inequalities and separation for capacitated economic lot sizing (Q1108195) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- Lot-size models with backlogging: Strong reformulations and cutting planes (Q1115342) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- An approximate method for local optima for nonlinear mixed integer programming problems (Q1200840) (← links)
- The teacher assignment problem: A special case of the fixed charge transportation problem (Q1278981) (← links)
- Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
- Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- Optimal competence set expansion using deduction graphs (Q1321446) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- The complementary class of generalized flow cover inequalities (Q1364783) (← links)
- A binary integer linear program with multi-criteria and multi-constraint levels (Q1373885) (← links)
- Solving mixed integer programming production planning problems with setups by shadow price information. (Q1406717) (← links)
- Preprocessing and cutting for multiple allocation hub location problems. (Q1427587) (← links)
- A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
- Fixed-charge transportation problems on trees (Q1728231) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← 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)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds (Q1824557) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- The application of valid inequalities to the multi-stage lot-sizing problem (Q1894735) (← links)
- Long range planning in the process industries: A projection approach (Q1919201) (← links)
- Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074) (← links)
- Preprocessing and cutting planes with conflict graphs (Q2027062) (← links)
- Scheduling of a constellation of satellites: creating a mixed-integer linear model (Q2055368) (← links)
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
- Valid inequalities for mixed-integer programmes with fixed charges on sets of variables (Q2183195) (← links)
- Daily course pattern formulation and valid inequalities for the curriculum-based course timetabling problem (Q2281613) (← links)
