Networks
Optimal connected subgraphs: Integer programming formulations and polyhedra
Networks, Volume 80, Issue 3, Page 314-332, October 2022.
Networks
On the complexity of the bilevel minimum spanning tree problem
Networks, Volume 80, Issue 3, Page 338-355, October 2022.
Networks
A simple proof of the Gross‐Saccoman multigraph conjecture
Networks, Volume 80, Issue 3, Page 333-337, October 2022.
Networks
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
Networks, Volume 80, Issue 4, Page 502-571, December 2022.
Networks
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
Networks, Volume 81, Issue 2, Page 204-219, March 2023.
Networks
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks
Networks, Volume 81, Issue 2, Page 177-203, March 2023.
Networks
Valid inequalities and facets for multi‐module survivable network design problem
Networks, Volume 81, Issue 2, Page 155-176, March 2023.
Networks
Minimizing recovery cost of network optimization problems
Networks, Volume 81, Issue 1, Page 125-151, January 2023.
Networks
Fast upper and lower bounds for a large‐scale real‐world arc routing problem
Networks, Volume 81, Issue 1, Page 107-124, January 2023.