An Improved Implicit Enumeration Approach for Integer Programming
From MaRDI portal
Recommendations
- An improved partial enumeration algorithm for integer programming problems
- scientific article; zbMATH DE number 5926438
- A new implicit enumerative search for the solution to an integer linear program
- Integer Programming by Implicit Enumeration and Balas’ Method
- Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem
- An implicit enumeration method for global optimization problems
- Algorithm for a class of integer programming problems with implicit constraints
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- An implicit enumeration procedure for the general linear complementarity problem
Cited in
(58)- An improved partial enumeration algorithm for integer programming problems
- Development of a new approach for deterministic supply chain network design
- Zero-one integer programs with few contraints - lower bounding theory
- A single-branch implicit enumeration algorithm for zero-one programs with geometrical constraints
- A heuristic for multiple choice programming
- Surrogate duality in a branch-and-bound procedure for integer programming
- A probabilistic heuristic for a computationally difficult set covering problem
- An interior point algorithm to solve computationally difficult set covering problems
- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung
- An implicit enumeration algorithm for the all integer programming problem
- Branching from the largest upper bound. Folklore and facts
- Zero-one programming with many variables and few constraints
- Computational experience with an algorithm for 0-1 integer programming
- An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem
- On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems
- The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
- Implied constraints and a unified theory of duality in linear and nonlinear programming
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
- The multidimensional 0-1 knapsack problem: an overview.
- Improved sorting-based procedure for integer programming
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Discrete dynamical system approaches for Boolean polynomial optimization
- A survey on the continuous nonlinear resource allocation problem
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- scientific article; zbMATH DE number 5926438 (Why is no real title available?)
- Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
- An implicit enumeration scheme for the batch selection problem
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
- Ein kapazitiver enumerationsalgorithmus für lineare opti- mierungsprobleme mit ganzzahligkeitsbedingungen
- A versatile scheme for ranking the extreme points of an assignment polytope
- An Enterprise Risk Management Model for Supply Chains
- On the complexity of the surrogate dual of 0–1 programming
- Minimal covering problem and PLA minimization
- scientific article; zbMATH DE number 3980925 (Why is no real title available?)
- scientific article; zbMATH DE number 4083364 (Why is no real title available?)
- A note on some computationally difficult set covering problems
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- A heuristic routine for solving large loading problems
- A branch and bound algorithm for the generalized assignment problem
- Vertex packings: Structural properties and algorithms
- Resolution of the 0–1 knapsack problem: Comparison of methods
- Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S
- The Collapsing 0–1 Knapsack Problem
- Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem
- scientific article; zbMATH DE number 1082009 (Why is no real title available?)
- Heuristically aided set-covering algorithms
- A new implicit enumerative search for the solution to an integer linear program
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- scientific article; zbMATH DE number 3390546 (Why is no real title available?)
- Computational experience with a group theoretic integer programming algorithm
- Multi-level integer programming problem with multiple objectives at each level
- Classical cuts for mixed-integer programming and branch-and-cut
- Mixed-integer bilinear programming problems
- Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem
- Large-scale mixed integer programming: Benders-type heuristics
- Second-order cover inequalities
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
This page was built for publication: An Improved Implicit Enumeration Approach for Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5562361)
