Time-Dependent Travelling Salesman Problem : the deliveryman case

von Lucena, Abílio
Veröffentlicht 1988

Special issue on ISMP 2006 : [... International Symposium on Mathematical Programming ... held in Rio de Janeiro, from July 31 to August 4, 2006 ...]

Veröffentlicht 2008

Modeling and solving the angular constrained minimum spanning tree problem

von Cunha, Alexandre Salles da
Veröffentlicht in Computers & operations research (2019)

Reformulations and solution algorithms for the maximum leaf spanning tree problem

von Lucena, Abílio
Veröffentlicht in Computational Management Science (2010)

Extended formulations for perfect domination problems and their algorithmic implications

von Forte, Vinícius Leal do
Veröffentlicht in European journal of operational research (2023)

Optimality cuts and a branch-and-cut algorithm for the K-rooted mini-max spanning forest problem

von Cunha, Alexandre Salles da
Veröffentlicht in European journal of operational research (2015)

A Relax-and-Cut algorithm for the set partitioning problem

von Cavalcante, Victor F.
Veröffentlicht in Computers & operations research (2008)

Mathematical models for optimizing production chain planning in salmon farming

Veröffentlicht in International transactions in operational research (2013)

Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem

Veröffentlicht in Institute for Operations Research and the Management Sciences INFORMS journal on computing (2014)

A location-allocation model for logistics integration centers

von Guimarães, Vanessa de Almeida
Veröffentlicht in International journal of transport economics (2017)

Abstracts / ISMP 2006, 19th International Symposium on Mathematical Programming : July 30 - August 4, 2006, Rio de Janeiro, Brazil

Veröffentlicht 2006