| Publication | Date of Publication | Type |
|---|
On location-routing formulations for the Hamiltonian p-median problem
European Journal of Operational Research | 2026-04-27 | Paper |
Formulations and branch-and-cut algorithms for cycle covers with up to p cycles
European Journal of Operational Research | 2025-12-02 | Paper |
The Hamiltonian p-median problem: polyhedral results and branch-and-cut algorithms
European Journal of Operational Research | 2024-07-02 | Paper |
New path elimination constraints for multi-depot routing problems
Networks | 2024-05-03 | Paper |
Node based compact formulations for the Hamiltonian <i>p</i>‐median problem
Networks | 2024-01-18 | Paper |
A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
Networks | 2023-12-12 | Paper |
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
Networks | 2023-12-12 | Paper |
The travelling salesman problem with positional consistency constraints: an application to healthcare services
European Journal of Operational Research | 2023-07-10 | Paper |
Compact formulations for multi-depot routing problems: theoretical and computational comparisons
Computers & Operations Research | 2021-04-20 | Paper |
A polyhedral study of the diameter constrained minimum spanning tree problem
Discrete Applied Mathematics | 2020-08-31 | Paper |
Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem''
European Journal of Operational Research | 2020-05-27 | Paper |
Revisiting the Hamiltonian p-median problem: a new formulation on directed graphs and a branch-and-cut algorithm
European Journal of Operational Research | 2019-02-25 | Paper |
Layered graph approaches for combinatorial optimization problems
Computers & Operations Research | 2018-12-03 | Paper |
Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
European Journal of Operational Research | 2018-11-19 | Paper |
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem
Networks | 2018-09-04 | Paper |
Spanning trees with a constraint on the number of leaves. A new formulation
Computers & Operations Research | 2018-07-11 | Paper |
Branch-and-cut methods for the network design problem with vulnerability constraints
Computers & Operations Research | 2018-07-11 | Paper |
Models for the piecewise linear unsplittable multicommodity flow problems
European Journal of Operational Research | 2018-05-29 | Paper |
A comparison of several models for the Hamiltonian \(p\)-median problem
Networks | 2018-05-23 | Paper |
Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem
Networks | 2018-05-23 | Paper |
Design of survivable networks with vulnerability constraints
European Journal of Operational Research | 2018-02-16 | Paper |
Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
Discrete Applied Mathematics | 2017-12-20 | Paper |
Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
European Journal of Operational Research | 2017-12-06 | Paper |
Load-dependent and precedence-based models for pickup and delivery problems
Computers & Operations Research | 2016-11-17 | Paper |
On the hop-constrained survivable network design problem with reliable edges
Computers & Operations Research | 2016-11-17 | Paper |
The mixed capacitated arc routing problem with non-overlapping routes
European Journal of Operational Research | 2016-10-06 | Paper |
Improved integer linear programming formulations for the job sequencing and tool switching problem
European Journal of Operational Research | 2016-10-06 | Paper |
Single PON network design with unconstrained splitting stages
European Journal of Operational Research | 2016-07-06 | Paper |
Models for a Steiner multi-ring network design problem with revenues
Top | 2016-06-30 | Paper |
Spanning trees with variable degree bounds
European Journal of Operational Research | 2016-06-27 | Paper |
Hop constrained Steiner trees with multiple root nodes
European Journal of Operational Research | 2016-06-23 | Paper |
Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Natural and extended formulations for the time-dependent traveling salesman problem
Discrete Applied Mathematics | 2015-09-22 | Paper |
Profitable mixed capacitated arc routing and related problems
Top | 2015-05-04 | Paper |
The two-level diameter constrained spanning tree problem
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
EURO Journal on Computational Optimization | 2015-03-12 | Paper |
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
European Journal of Operational Research | 2015-02-03 | Paper |
An improved decomposition-based heuristic to design a water distribution network for an irrigation system
Annals of Operations Research | 2014-11-26 | Paper |
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities
European Journal of Operational Research | 2014-07-27 | Paper |
Polynomial-time separation of enhanced reverse multistar inequalities
Operations Research Letters | 2014-05-14 | Paper |
| Spanning trees with node degree cependent costs and knapsack reformulations | 2013-11-08 | Paper |
| On the vehicle routing problem with lower bound capacities | 2013-11-08 | Paper |
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
Networks | 2013-08-06 | Paper |
Enhancing discretized formulations: the knapsack reformulation and the star reformulation
Top | 2013-02-20 | Paper |
Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs
Networks | 2012-11-15 | Paper |
On the hop constrained Steiner tree problem with multiple root nodes
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Reload cost trees and network design
Networks | 2012-09-21 | Paper |
| On a time-dependent formulation and an updated classification of ATSP formulations | 2012-01-26 | Paper |
Lexicographical minimization of routing hops in telecommunication networks
Lecture Notes in Computer Science | 2011-09-09 | Paper |
The Skill Vehicle Routing Problem
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Reformulation by intersection method on the MST problem with lower bound on the number of leaves
Lecture Notes in Computer Science | 2011-09-09 | Paper |
The Two Level Network Design Problem with Secondary Hop Constraints
Lecture Notes in Computer Science | 2011-09-09 | Paper |
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Spanning trees with generalized degree constraints arising in the design of wireless networks
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
International Transactions in Operational Research | 2011-08-17 | Paper |
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
Journal of Heuristics | 2011-02-14 | Paper |
Models for a traveling purchaser problem with additional side-constraints
Computers & Operations Research | 2010-10-15 | Paper |
Prize collecting Steiner trees with node degree dependent costs
Computers & Operations Research | 2010-10-15 | Paper |
Discretized formulations for capacitated location problems with modular distribution costs
European Journal of Operational Research | 2010-01-25 | Paper |
A node rooted flow-based model for the local access network expansion problem
European Journal of Operational Research | 2010-01-15 | Paper |
Lower bounds for the mixed capacitated arc routing problem
Computers & Operations Research | 2009-11-27 | Paper |
Hop-constrained node survivable network design: An application to MPLS over WDM
Networks and Spatial Economics | 2009-11-04 | Paper |
Extended formulations for the cardinality constrained subtree of a tree problem
Operations Research Letters | 2009-08-14 | Paper |
Combined route capacity and route length models for unit demand vehicle routing problems
Discrete Optimization | 2008-10-29 | Paper |
The multi-weighted Steiner tree problem: A reformulation by intersection
Computers & Operations Research | 2008-04-28 | Paper |
Reformulation by discretization: application to economic lot sizing
Operations Research Letters | 2008-01-11 | Paper |
Models and heuristics for a minimum arborescence problem
Networks | 2008-01-08 | Paper |
Solving the variable size bin packing problem with discretized formulations
Computers & Operations Research | 2007-11-30 | Paper |
Modeling and solving the rooted distance-constrained minimum spanning tree problem
Computers & Operations Research | 2007-10-10 | Paper |
| On formulations and methods for the hop-constrained minimum spanning tree problem | 2007-07-23 | Paper |
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
Annals of Operations Research | 2007-02-05 | Paper |
Network flow models for the local access network expansion problem
Computers & Operations Research | 2006-12-07 | Paper |
Further contributions to network optimization
Networks | 2006-09-12 | Paper |
On the capacitated concentrator location problem: a reformulation by discretization
Computers & Operations Research | 2006-06-30 | Paper |
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
Computers & Operations Research | 2005-04-21 | Paper |
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
Networks | 2005-01-12 | Paper |
A note on hop-constrained walk polytopes.
Operations Research Letters | 2005-01-11 | Paper |
The capacitated minimum spanning tree problem: On improved multistar constraints
European Journal of Operational Research | 2004-11-22 | Paper |
Some recent contributions to network optimization
Networks | 2004-08-20 | Paper |
On the directed hop-constrained shortest path problem
Operations Research Letters | 2004-07-01 | Paper |
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
INFORMS Journal on Computing | 2003-12-16 | Paper |
Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
Networks | 2003-05-22 | Paper |
Multistars and directed flow formulations
Networks | 2003-03-19 | Paper |
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints
Discrete Applied Mathematics | 2002-07-30 | Paper |
Models for a Steiner ring network design problem with revenues
European Journal of Operational Research | 2002-07-04 | Paper |
An augmented arborescence formulation for the two-level network design problem
Annals of Operations Research | 2002-06-09 | Paper |
Minimal spanning trees with a constraint on the number of leaves
European Journal of Operational Research | 2001-03-22 | Paper |
Designing reliable tree networks with two cable technologies
European Journal of Operational Research | 2001-02-22 | Paper |
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
European Journal of Operational Research | 2001-01-01 | Paper |
| scientific article; zbMATH DE number 1420487 (Why is no real title available?) | 2000-06-27 | Paper |
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
European Journal of Operational Research | 2000-03-19 | Paper |
The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints
European Journal of Operational Research | 1999-12-20 | Paper |
The capacitated minimal spanning tree problem: An experiment with a hop-indexed model
Annals of Operations Research | 1999-06-10 | Paper |
Multicommodity flow models for spanning trees with hop constraints
European Journal of Operational Research | 1999-04-22 | Paper |
A result on projection for the vehicle routing problem
European Journal of Operational Research | 1998-08-13 | Paper |
A classification of formulations for the (time-dependent) traveling salesman problem
European Journal of Operational Research | 1998-06-11 | Paper |
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints
Computers & Operations Research | 1997-01-19 | Paper |
A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
Operations Research | 1995-08-01 | Paper |
