Integer Programming by Implicit Enumeration and Balas’ Method
From MaRDI portal
Cited in
(28)- Zero-one integer programs with few contraints - lower bounding theory
- A branch and bound algorithm for extreme point mathematical programming problems
- A heuristic for multiple choice programming
- Experiments in integer programming
- Numerische Erfahrungen mit der Filtermethode von Balas in der linearen binären Optimierung
- An implicit enumeration algorithm for the all integer programming problem
- Calculating uncertainty intervals in approximate equation systems
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem
- Multi-item capacitated lot-sizing by a cross decomposition based algorithm
- Some new perspectives for solving 0--1 integer programming problems using balas method
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- An optimization model to determine master designs and runs for advertisement printing
- scientific article; zbMATH DE number 5926438 (Why is no real title available?)
- Models and methods of solution of quadratic integer programming problems
- Resolution of the 0–1 knapsack problem: Comparison of methods
- Ein lexikographischer Suchalgorithmus zur ganzzahligen Programmierung: L E X S
- Preventing redundant solutions in partial enumeration algorithms
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- Optimal expansion of an existing network
- Location and allocation based branch and bound algorithms for the capacitated multi-facility Weber problem
- Cost-minimal trees in directed acyclic graphs
- On minimum weakly connected independent sets for wireless sensor networks: properties and enumeration algorithm
- A revised Taha's algorithm for polynomial 0-1 programming
- An Improved Implicit Enumeration Approach for Integer Programming
- scientific article; zbMATH DE number 3390546 (Why is no real title available?)
- Enumerative inequalities in integer programming
- An implicit enumeration program for zero-one integer programming
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
This page was built for publication: Integer Programming by Implicit Enumeration and Balas’ Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5615773)
