A branch-and-cut algorithm for the plant-cycle location problem
- 1 May 2004
- journal article
- Published by Taylor & Francis Ltd in Journal of the Operational Research Society
- Vol. 55 (5), 513-520
- https://doi.org/10.1057/palgrave.jors.2601692
Abstract
Journal of the Operational Research Society (JORS) is the world's longest established OR journal and an official journal of The OR Society. It is the aim of the Journal to present papers which are relevant to practitioners, researchers, teachers, students and consumers of operational research, and which cover the theory, practice, history or methodology of OR.This publication has 7 references indexed in Scilit:
- Optimisation of the interconnecting network of a UMTS radio mobile telephone systemEuropean Journal of Operational Research, 2003
- Solving the Orienteering Problem through Branch-and-CutINFORMS Journal on Computing, 1998
- Introduction to ABACUS – a branch-and-cut systemOperations Research Letters, 1998
- A heuristic solution to the warehouse location-routing problemEuropean Journal of Operational Research, 1994
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsSIAM Review, 1991
- An exact algorithm for solving a capacitated location-routing problemAnnals of Operations Research, 1986
- A warehouse location-routing problemTransportation Research Part B: Methodological, 1985