Refine
Language
- English (3)
Keywords
- IP (1)
- Instances (1)
- MIP (1)
- Mathematical Programming (1)
- Mixed Integer Programming (1)
- Optimization (1)
Project
- B4 (1)
Application Area
- B (1)
The UMTS radio network planning problem poses the challenge of designing a cost-effective network that provides users with sufficient coverage and capacity. We describe an optimization model for this problem that is based on comprehensive planning data of the EU project MOMENTUM. We present heuristic mathematical methods for this realistic model, including computational results.
MIPLIB 2003
(2005)
This paper is about the fourth version of the Mixed Integer Programming Library (MIPLIB).
More than 7 years have been past since the last update. Since the focus of the MIPLIB is to provide a concise set of challenging problems, it became again necessary to purge the library from instances that have become too easy due to improvements in optimizers and computing machinery.
The free slots have been filled by 27 new challenging instances. We give an overview of the new problems and present statistical data for all 60 instances included in the MIPLIB 2003.
Branching Rules Revisited
(2004)
Mixed integer programs are commonly solved with linear programming
based branch-and-bound algorithms. The success of the algorithm
strongly depends on the strategy used to select the variable to
branch on.
We present a new generalization called reliability branching of today's
state-of-the-art strong branching and pseudocost branching branching
strategies for linear programming based branch-and-bound algorithms.
After reviewing commonly used branching strategies and performing
extensive computational studies we compare different parameter
settings and show the superiority of our proposed new strategy.