Pages that link to "Item:Q1683126"
From MaRDI portal
The following pages link to Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem (Q1683126):
Displaying 8 items.
- A new formulation and approach for the black and white traveling salesman problem (Q337265) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
- Heuristics for the black and white traveling salesman problem (Q1869887) (← links)
- Corrigendum to: ``Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem'' (Q2184081) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- The Black and White Traveling Salesman Problem (Q3391982) (← links)
- Layered graph models for the electric vehicle routing problem with nonlinear charging functions (Q6663970) (← links)
