A branch-and-cut algorithm for the plant-cycle location problem

DOI10.1057/PALGRAVE.JORS.2601692MaRDI QIDQ4661044zbMATH OpenOpenAlexFDO

Authors Martine Labbé, Inmaculada Rodríguez-Martín, Juan-José Salazar-González

Publication date 4 April 2005

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2601692

zbMATH Keywords

mathematical programmingoptimizationtelecommunications

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Exact and heuristic approaches for the cycle hub location problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A branch-and-cut algorithm for the maximum covering cycle problem
• A branch-and-cut algorithm for the hub location and routing problem
• A branch-and-price algorithm for the capacitated facility location problem

Cited in

(16)

• The ring spur assignment problem: new formulation, valid inequalities and a branch-and-cut approach
• Exact and heuristic approaches for the cycle hub location problem
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
• Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network
• 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
• Cost-effective designs of fault-tolerant access networks in communication systems
• The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm
• Rapid transit network design for optimal cost and origin-destination demand capture
• A branch-and-cut algorithm for the hub location and routing problem
• 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-price-and-cut algorithm for the cable-routing problem in solar power plants
• A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
• Location-routing: issues, models and methods

Describes a project that uses

Uses Software

• ABACUS

This page was built for publication: A branch-and-cut algorithm for the plant-cycle location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4661044)