The following pages link to Luís Gouveia (Q194429):
Displayed 50 items.
- (Q299844) (redirect page) (← links)
- Hop constrained Steiner trees with multiple root nodes (Q299847) (← links)
- Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- Improved integer linear programming formulations for the job sequencing and tool switching problem (Q319452) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- On the hop-constrained survivable network design problem with reliable edges (Q342080) (← links)
- An improved decomposition-based heuristic to design a water distribution network for an irrigation system (Q475224) (← links)
- Natural and extended formulations for the time-dependent traveling salesman problem (Q496646) (← links)
- Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem (Q623311) (← links)
- A note on hop-constrained walk polytopes. (Q703241) (← links)
- Prize collecting Steiner trees with node degree dependent costs (Q709134) (← links)
- Models for a traveling purchaser problem with additional side-constraints (Q709202) (← links)
- (Q833576) (redirect page) (← links)
- Extended formulations for the cardinality constrained subtree of a tree problem (Q833578) (← links)
- Network flow models for the local access network expansion problem (Q856692) (← links)
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees (Q863567) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Hop-constrained node survivable network design: An application to MPLS over WDM (Q1035728) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- A result on projection for the vehicle routing problem (Q1127162) (← links)
- Multicommodity flow models for spanning trees with hop constraints (Q1278374) (← links)
- The capacitated minimal spanning tree problem: An experiment with a hop-indexed model (Q1290151) (← links)
- Minimal spanning trees with a constraint on the number of leaves (Q1291653) (← links)
- Designing reliable tree networks with two cable technologies (Q1291775) (← links)
- A classification of formulations for the (time-dependent) traveling salesman problem (Q1388929) (← links)
- On the directed hop-constrained shortest path problem (Q1433652) (← links)
- An augmented arborescence formulation for the two-level network design problem (Q1599298) (← links)
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
- Branch-and-cut methods for the network design problem with vulnerability constraints (Q1652559) (← links)
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126) (← links)
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol (Q1686055) (← links)
- Design of survivable networks with vulnerability constraints (Q1698886) (← links)
- Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm (Q1728472) (← links)
- Models for the piecewise linear unsplittable multicommodity flow problems (Q1753554) (← links)
- The capacitated minimum spanning tree problem: revisiting hop-indexed formulations (Q1772873) (← links)
- The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints (Q1806889) (← links)
- The capacitated minimum spanning tree problem: On improved multistar constraints (Q1887863) (← links)
- Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints (Q1919978) (← links)
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
- Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs (Q1969869) (← links)
- Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem'' (Q2184081) (← links)
- A polyhedral study of the diameter constrained minimum spanning tree problem (Q2197445) (← links)
- Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities (Q2253496) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- The two-level diameter constrained spanning tree problem (Q2340278) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- Modeling and solving the rooted distance-constrained minimum spanning tree problem (Q2384910) (← links)