A branch-and-cut algorithm for the plant-cycle location problem
From MaRDI portal
Publication:4661044
DOI10.1057/palgrave.jors.2601692zbMath1060.90053OpenAlexW1970975943MaRDI QIDQ4661044
Inmaculada Rodríguez-Martín, Juan-José Salazar-González, Martine Labbé
Publication date: 4 April 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601692
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm, Location-routing: issues, models and methods, Rapid transit network design for optimal cost and origin-destination demand capture, A branch-and-cut algorithm for the hub location and routing problem, The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach, A branch-and-cut algorithm for two-level survivable network design problems, Multi-depot multiple TSP: a polyhedral study and computational results, A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem, Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, Cost-effective designs of fault-tolerant access networks in communication systems, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, A taxonomical analysis, current methods and objectives on location-routing problems
Uses Software
