A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
Author
Abstract
Suggested Citation
DOI: 10.1287/opre.43.1.130
Download full text from publisher
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Gouveia, Luis, 1995. "A result on projection for the vehicle routing ptoblem," European Journal of Operational Research, Elsevier, vol. 85(3), pages 610-624, September.
- Bernard Gendron & Luis Gouveia, 2017. "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 51(2), pages 629-649, May.
- Amberg, Anita & Domschke, Wolfgang & Vo[ss], Stefan, 2000. "Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees," European Journal of Operational Research, Elsevier, vol. 124(2), pages 360-376, July.
- Gouveia, Luís & Paias, Ana & Ponte, Mafalda, 2023. "The travelling salesman problem with positional consistency constraints: An application to healthcare services," European Journal of Operational Research, Elsevier, vol. 308(3), pages 960-989.
- Rahma Lahyani & Leandro C. Coelho & Jacques Renaud, 2018. "Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 125-157, January.
- Kawatra, R. & Bricker, D., 2000. "A multiperiod planning model for the capacitated minimal spanning tree problem," European Journal of Operational Research, Elsevier, vol. 121(2), pages 412-419, March.
- Uchoa, Eduardo & Fukasawa, Ricardo & Lysgaard, Jens & Pessoa, Artur & Poggi de Aragão, Marcus & Andrade, Diogo, 2006. "Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation," CORAL Working Papers L-2006-08, University of Aarhus, Aarhus School of Business, Department of Business Studies.
- Cesar Rego & Frank Mathew & Fred Glover, 2010. "RAMP for the capacitated minimum spanning tree problem," Annals of Operations Research, Springer, vol. 181(1), pages 661-681, December.
- Fernandes, Lucinda Matos & Gouveia, Luis, 1998. "Minimal spanning trees with a constraint on the number of leaves," European Journal of Operational Research, Elsevier, vol. 104(1), pages 250-261, January.
- Correia, Isabel & Gouveia, Luís & Saldanha-da-Gama, Francisco, 2010. "Discretized formulations for capacitated location problems with modular distribution costs," European Journal of Operational Research, Elsevier, vol. 204(2), pages 237-244, July.
- Gen, Mitsuo & Kumar, Anup & Ryul Kim, Jong, 2005. "Recent network design techniques using evolutionary algorithms," International Journal of Production Economics, Elsevier, vol. 98(2), pages 251-261, November.
- Ricardo Fukasawa & Qie He & Yongjia Song, 2016. "A Branch-Cut-and-Price Algorithm for the Energy Minimization Vehicle Routing Problem," Transportation Science, INFORMS, vol. 50(1), pages 23-34, February.
- Gouveia, Luis & Lopes, Maria Joao, 2000. "Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs," European Journal of Operational Research, Elsevier, vol. 121(2), pages 394-411, March.
- Xiaojun Zhu & Shaojie Tang, 2021. "A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1446-1460, October.
- Gouveia, Luís & Lopes, Maria João & de Sousa, Amaro, 2015. "Single PON network design with unconstrained splitting stages," European Journal of Operational Research, Elsevier, vol. 240(2), pages 361-371.
- Antonio Frangioni, 2005. "About Lagrangian Methods in Integer Optimization," Annals of Operations Research, Springer, vol. 139(1), pages 163-193, October.
- Luís Gouveia & Pedro Moura, 2012. "Enhancing discretized formulations: the knapsack reformulation and the star reformulation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 52-74, April.
- Raymond A. Patterson & Erik Rolland, 2002. "Hybrid Fiber Coaxial Network Design," Operations Research, INFORMS, vol. 50(3), pages 538-551, June.
- Gouveia, Luis & Leitner, Markus & Ruthmair, Mario, 2017. "Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 262(3), pages 908-928.
- Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
- Andrea Bettinelli & Alberto Ceselli & Giovanni Righini, 2010. "A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint," Annals of Operations Research, Springer, vol. 179(1), pages 221-241, September.
More about this item
Keywords
networks/graphs: capacitated tree algorithms; programming; integer: Lagrangian relaxation/cutting planes;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:43:y:1995:i:1:p:130-141. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.