A Polyhedral Study of Integer Variable Upper Bounds
Mathematics of Operations Research
On the facets of the simple plant location packing polytope
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Locating repair shops in a stochastic environment
Computers and Operations Research
Exact procedures for solving the discrete ordered median problem
Computers and Operations Research
Polyhedral Analysis for Concentrator Location Problems
Computational Optimization and Applications
Multi-period capacitated location with modular equipments
Computers and Operations Research
Box-constrained quadratic programs with fixed charge variables
Journal of Global Optimization
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A flexible model and efficient solution strategies for discrete location problems
Discrete Applied Mathematics
Lower and upper bounds for a capacitated plant location problem with multicommodity flow
Computers and Operations Research
A cutting plane algorithm for the capacitated facility location problem
Computational Optimization and Applications
An effective heuristic for large-scale capacitated facility location problems
Journal of Heuristics
Locating repair shops in a stochastic environment
Computers and Operations Research
Fixed-charge transportation on a path: linear programming formulations
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A tabu search heuristic procedure for the capacitated facility location problem
Journal of Heuristics
Near-optimal solutions to large-scale facility location problems
Discrete Optimization
A family of facets for the uncapacitated p-median polytope
Operations Research Letters
| Hi-index | 0.00 |