Pages that link to "Item:Q5562361"
From MaRDI portal
The following pages link to An Improved Implicit Enumeration Approach for Integer Programming (Q5562361):
Displaying 45 items.
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
- Mixed-integer bilinear programming problems (Q687032) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- Second-order cover inequalities (Q927162) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Development of a new approach for deterministic supply chain network design (Q1027594) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- A heuristic for multiple choice programming (Q1089261) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- A probabilistic heuristic for a computationally difficult set covering problem (Q1122493) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung (Q1217449) (← links)
- An implicit enumeration algorithm for the all integer programming problem (Q1245147) (← links)
- Branching from the largest upper bound. Folklore and facts (Q1247917) (← links)
- Zero-one programming with many variables and few constraints (Q1247918) (← links)
- Computational experience with an algorithm for 0-1 integer programming (Q1256963) (← links)
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem (Q1291694) (← links)
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems (Q1314325) (← links)
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm (Q1318275) (← links)
- Implied constraints and a unified theory of duality in linear and nonlinear programming (Q1319546) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds (Q2569064) (← links)
- Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning» (Q3035139) (← links)
- A versatile scheme for ranking the extreme points of an assignment polytope (Q3320125) (← links)
- An Enterprise Risk Management Model for Supply Chains (Q3638502) (← links)
- On the complexity of the surrogate dual of 0–1 programming (Q3725870) (← links)
- Minimal covering problem and PLA minimization (Q3735634) (← links)
- A note on some computationally difficult set covering problems (Q3867546) (← links)
- Two stage linear programming under uncertainty with 0–1 integer first stage variables (Q3885534) (← links)
- A heuristic routine for solving large loading problems (Q3962774) (← links)
- A branch and bound algorithm for the generalized assignment problem (Q4066849) (← links)
- Vertex packings: Structural properties and algorithms (Q4074668) (← links)
- Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670) (← links)
- Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S (Q4099420) (← links)
- The Collapsing 0–1 Knapsack Problem (Q4175049) (← links)
- Heuristically aided set-covering algorithms (Q4401517) (← links)
- (Q5659341) (← links)
- Computational experience with a group theoretic integer programming algorithm (Q5671787) (← links)
- (Q5860583) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
