Pages that link to "Item:Q3696859"
From MaRDI portal
The following pages link to Solving Large-Scale Zero-One Linear Programming Problems (Q3696859):
Displaying 50 items.
- Implicit cover inequalities (Q266036) (← links)
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems (Q377748) (← links)
- The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints (Q378090) (← links)
- Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing (Q439361) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- Some of my favorite integer programming applications at IBM (Q537591) (← links)
- My experiences as a student and researcher in OR during the 1960's and 70's (Q537599) (← links)
- Hooked on IP (Q537605) (← links)
- Broadening the integer programming audience, the LINDO perspective (Q537610) (← links)
- IP over 40+ years at IBM scientific centers and marketing (Q537612) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Parametric-objective integer programming using knapsack facets and Gomory cutting planes (Q579128) (← links)
- A computational comparison of Gomory and knapsack cuts (Q580177) (← links)
- Lifting, tilting and fractional programming revisited (Q614041) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem (Q632643) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- Lifting cover inequalities for the precedence-constrained knapsack problem (Q674439) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- The convex hull of two core capacitated network design problems (Q689128) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- Achievement test construction using 0-1 linear programming (Q807371) (← links)
- A facet generation and relaxation technique applied to an assignment problem with side constraints (Q810374) (← links)
- Generating random points (or vectors) controlling the percentage of them that are extreme in their convex (or positive) hull (Q814963) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- Integer-programming software systems (Q817202) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Coefficient strengthening: a tool for reformulating mixed-integer programs (Q847848) (← links)
- On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
- Exploiting nested inequalities and surrogate constraints (Q858413) (← links)
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
- Progress in presolving for mixed integer programming (Q903920) (← links)
- The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
- Facet defining inequalities for the dichotomous knapsack problem (Q911989) (← links)
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds (Q914548) (← links)
- A production planning problem in FMS (Q917423) (← links)
- Generating cuts in integer programming with families of special ordered sets (Q922293) (← links)
- Second-order cover inequalities (Q927162) (← links)
