Luis Eduardo Neves Gouveia

Ruslan Sadykov

Eur. J. Oper. Res., 2020

A polyhedral study of the diameter constrained minimum spanning tree problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Compact formulations for multi-depot routing problems: Theoretical and computational comparisons.

[BibT_eX]

[DOI]

Daniel Santos

Comput. Oper. Res., 2020

2019

Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm.

[BibT_eX]

[DOI]

Daniel Santos

Eur. J. Oper. Res., 2019

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm.

[BibT_eX]

[DOI]

Antonio Martinez-Sykora

Eur. J. Oper. Res., 2019

Layered graph approaches for combinatorial optimization problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

2018

Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem.

[BibT_eX]

[DOI]

Networks, 2018

New advances and applications in deterministic and stochastic network optimization.

[BibT_eX]

[DOI]

Networks, 2018

Preface.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

The 2 edge-disjoint 3-paths polyhedron.

[BibT_eX]

[DOI]

Quentin Botton

Ann. des Télécommunications, 2018

2017

Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems.

[BibT_eX]

[DOI]

Bernard Gendron

Transp. Sci., 2017

Preface: Static and dynamic optimization models for network routing problems.

[BibT_eX]

[DOI]

Michal Pióro

Jacek Rak

Networks, 2017

New path elimination constraints for multi-depot routing problems.

[BibT_eX]

[DOI]

Daniel Santos

Networks, 2017

Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Design of survivable networks with vulnerability constraints.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Models for the piecewise linear unsplittable multicommodity flow problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Spanning trees with a constraint on the number of leaves. A new formulation.

[BibT_eX]

[DOI]

Luidi Simonetti

Comput. Oper. Res., 2017

2016

Lexicographical minimization of routing hops in hop-constrained node survivable networks.

[BibT_eX]

[DOI]

Telecommun. Syst., 2016

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem.

[BibT_eX]

[DOI]

I. Diarrassouba

Virginie Gabrel

Ali Ridha Mahjoub

Networks, 2016

Editorial.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2016

Preface.

[BibT_eX]

[DOI]

Andrea Lodi

Ali Ridha Mahjoub

Discret. Optim., 2016

Maximization of protected demand in telecommunication networks using partial disjoint paths.

[BibT_eX]

[DOI]

Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016

On the convex piecewise linear unsplittable multicommodity flow problem.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016

2015

The two-level diameter constrained spanning tree problem.

[BibT_eX]

[DOI]

Math. Program., 2015

Single PON network design with unconstrained splitting stages.

[BibT_eX]

[DOI]

Maria João Lopes

Miguel Fragoso Constantino

Eur. J. Oper. Res., 2015

The mixed capacitated arc routing problem with non-overlapping routes.

[BibT_eX]

[DOI]

Maria Cândida Mourão

Ana Catarina Nunes

Eur. J. Oper. Res., 2015

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem.

[BibT_eX]

[DOI]

Daniele Catanzaro

Martine Labbé

Eur. J. Oper. Res., 2015

Solving the maximum edge-weight clique problem in sparse graphs with compact formulations.

[BibT_eX]

[DOI]

Pedro Martins

EURO J. Comput. Optim., 2015

Load-dependent and precedence-based models for pickup and delivery problems.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

On the hop-constrained survivable network design problem with reliable edges.

[BibT_eX]

[DOI]

Quentin Botton

Comput. Oper. Res., 2015

2014

A comparison of several models for the hamiltonian p-median problem.

[BibT_eX]

[DOI]

Gilbert Laporte

Dilson Lucas Pereira

Adam Wojciechowski

Networks, 2014

Spanning trees with variable degree bounds.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Hop constrained Steiner trees with multiple root nodes.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Natural and extended formulations for the Time-Dependent Traveling Salesman Problem.

[BibT_eX]

[DOI]

Maria Teresa Godinho

Discret. Appl. Math., 2014

An improved decomposition-based heuristic to design a water distribution network for an irrigation system.

[BibT_eX]

[DOI]

Graça Marques Gonçalves

Margarida Vaz Pato

Ann. Oper. Res., 2014

Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol.

[BibT_eX]

[DOI]

Martim Moniz

Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013

Polynomial-time separation of Enhanced Reverse Multistar inequalities.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Editorial.

[BibT_eX]

[DOI]

Stefan Voß

Networks, 2013

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route.

[BibT_eX]

[DOI]

Jorge Riera-Ledesma

Networks, 2013

Benders Decomposition for the Hop-Constrained Survivable Network Design Problem.

[BibT_eX]

[DOI]

Quentin Botton

Michael Poss

INFORMS J. Comput., 2013

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2013

Models and valid inequalities to asymmetric skill-based routing problems.

[BibT_eX]

[DOI]

Paola Cappanera

Maria Grazia Scutellà

EURO J. Transp. Logist., 2013

SI on computational methods for network optimization problems.

[BibT_eX]

[DOI]

EURO J. Comput. Optim., 2013

2012

Editorial.

[BibT_eX]

[DOI]

Maria Grazia Scutellà

Networks, 2012

Reload cost trees and network design.

[BibT_eX]

[DOI]

Ioannis Gamvros

S. Raghavan

Networks, 2012

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs.

[BibT_eX]

[DOI]

Christophe Duhamel

Maurício C. de Souza

Networks, 2012

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs.

[BibT_eX]

[DOI]

Luidi Simonetti

Eduardo Uchoa

Math. Program., 2011

Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models.

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2011

Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem.

[BibT_eX]

[DOI]

Ana Paias

Dushyant Sharma

J. Heuristics, 2011

Models for a traveling purchaser problem with additional side-constraints.

[BibT_eX]

[DOI]

Ana Paias

Stefan Voß

Comput. Oper. Res., 2011

Prize collecting Steiner trees with node degree dependent costs.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2011

Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves.

[BibT_eX]

[DOI]

João Telhada

Proceedings of the Network Optimization - 5th International Conference, 2011

Lexicographical Minimization of Routing Hops in Telecommunication Networks.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

The Two Level Network Design Problem with Secondary Hop Constraints.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.

[BibT_eX]

[DOI]

Proceedings of the Network Optimization - 5th International Conference, 2011

The Skill Vehicle Routing Problem.

[BibT_eX]

[DOI]

Paola Cappanera

Maria Grazia Scutellà

Proceedings of the Network Optimization - 5th International Conference, 2011

2010

A node rooted flow-based model for the local access network expansion problem.

[BibT_eX]

[DOI]

Margarida Corte-Real

Eur. J. Oper. Res., 2010

Discretized formulations for capacitated location problems with modular distribution costs.

[BibT_eX]

[DOI]

Isabel Correia

Francisco Saldanha-da-Gama

Eur. J. Oper. Res., 2010

On the Vehicle Routing Problem with lower bound capacities.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2010

Hop-indexed Circuit-based formulations for the Traveling Salesman Problem.

[BibT_eX]

[DOI]

Maria Teresa Godinho

Electron. Notes Discret. Math., 2010

Lower bounds for the mixed capacitated arc routing problem.

[BibT_eX]

[DOI]

Maria Cândida Mourão

Leonor Santiago Pinto

Comput. Oper. Res., 2010

2009

Extended formulations for the cardinality constrained subtree of a tree problem.

[BibT_eX]

[DOI]

Agostinho Agra

Oper. Res. Lett., 2009

Preface.

[BibT_eX]

[DOI]

Networks, 2009

2008

Models and heuristics for a minimum arborescence problem.

[BibT_eX]

[DOI]

Christophe Duhamel

Maurício C. de Souza

Networks, 2008

Combined route capacity and route length models for unit demand vehicle routing problems.

[BibT_eX]

[DOI]

Maria Teresa Godinho

Discret. Optim., 2008

The multi-weighted Steiner tree problem: A reformulation by intersection.

[BibT_eX]

[DOI]

João Telhada

Comput. Oper. Res., 2008

Modeling and solving the rooted distance-constrained minimum spanning tree problem.

[BibT_eX]

[DOI]

Ana Paias

Dushyant Sharma

Comput. Oper. Res., 2008

Solving the variable size bin packing problem with discretized formulations.

[BibT_eX]

[DOI]

Isabel Correia

Francisco Saldanha-da-Gama

Comput. Oper. Res., 2008

2007

Reformulation by discretization: Application to economic lot sizing.

[BibT_eX]

[DOI]

Miguel Fragoso Constantino

Oper. Res. Lett., 2007

Preface.

[BibT_eX]

[DOI]

Stefan Voß

Networks, 2007

Preface.

[BibT_eX]

[DOI]

Walid Ben-Ameur

Networks, 2007

Network flow models for the local access network expansion problem.

[BibT_eX]

[DOI]

Margarida Corte-Real

Comput. Oper. Res., 2007

2006

On extended formulations for the precedence constrained asymmetric traveling salesman problem.

[BibT_eX]

[DOI]

Networks, 2006

Further contributions to network optimization.

[BibT_eX]

[DOI]

Walid Ben-Ameur

Networks, 2006

On the capacitated concentrator location problem: a reformulation by discretization.

[BibT_eX]

[DOI]

Francisco Saldanha-da-Gama

Comput. Oper. Res., 2006

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2006

On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem.

[BibT_eX]

[DOI]

Geir Dahl

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005

The capacitated minimum spanning tree problem: On improved multistar constraints.

[BibT_eX]

[DOI]

Maria João Lopes

Eur. J. Oper. Res., 2005

The capacitated minimum spanning tree problem: revisiting hop-indexed formulations.

[BibT_eX]

[DOI]

Pedro Martins

Comput. Oper. Res., 2005

2004

On the directed hop-constrained shortest path problem.

[BibT_eX]

[DOI]

Geir Dahl

Oper. Res. Lett., 2004

A note on hop-constrained walk polytopes.

[BibT_eX]

[DOI]

Geir Dahl

Njål Foldnes

Oper. Res. Lett., 2004

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.

[BibT_eX]

[DOI]

Networks, 2004

Some recent contributions to network optimization.

[BibT_eX]

[DOI]

Walid Ben-Ameur

Networks, 2004

2003

Network flow models for designing diameter-constrained minimum-spanning and Steiner trees.

[BibT_eX]

[DOI]

Networks, 2003

MPLS over WDM Network Design with Packet Level QoS Constraints based on ILP Models.

[BibT_eX]

[DOI]

Rui Valadas

Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002

Multistars and directed flow formulations.

[BibT_eX]

[DOI]

Leslie A. Hall

Networks, 2002

2001

A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem.

[BibT_eX]

[DOI]