Integer and combinatorial optimization
Integer and combinatorial optimization
Modern heuristic techniques for combinatorial problems
Presolving in linear programming
Mathematical Programming: Series A and B
Variable metric bundle methods: from conceptual to implementable forms
Mathematical Programming: Series A and B - Special issue on computational nonsmooth optimization
A Lagrangian-based heuristic for large-scale set covering problems
Mathematical Programming: Series A and B - Special issue on computational integer programming
A Heuristic Algorithm for the Set Covering Problem
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Optimal Commonality in Component Design
Operations Research
Solving the p-Median Problem with a Semi-Lagrangian Relaxation
Computational Optimization and Applications
The problem of margin calculation and its reduction via the p-Median problem model
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
An experimental study for the selection of modules and facilities in a mass customization context
Journal of Intelligent Manufacturing
Data aggregation for p-median problems
Journal of Combinatorial Optimization
INOC'11 Proceedings of the 5th international conference on Network optimization
Solving Large p-Median Problems with a Radius Formulation
INFORMS Journal on Computing
Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
Computational Optimization and Applications
A computational study of a nonlinear minsum facility location problem
Computers and Operations Research
Complexity evaluation of benchmark instances for the p-median problem
Mathematical and Computer Modelling: An International Journal
A constraint programming approach for the traveling purchaser problem
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
In some industries, a certain part can be needed in a very large number of different configurations. This is the case, e.g., for the electrical wirings in European car factories. A given configuration can be replaced by a more complete, therefore more expensive, one. The diversity management problem consists of choosing an optimal set of some given number k of configurations that will be produced, any nonproduced configuration being replaced by the cheapest produced one that is compatible with it. We model the problem as an integer linear program. Our aim is to solve those problems to optimality. The large-scale instances we are interested in lead to difficult LP relaxations, which seem to be intractable by the best direct methods currently available. Most of this paper deals with the use of Lagrangean relaxation to reduce the size of the problem in order to be able, subsequently, to solve it to optimality via classical integer optimization.