Pages that link to "Item:Q3471856"
From MaRDI portal
The following pages link to A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints (Q3471856):
Displaying 7 items.
- Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs (Q895762) (← links)
- Survey of facial results for the traveling salesman polytope (Q1596750) (← links)
- Extended formulations for the \(A\)-cut problem (Q1915806) (← links)
- Modeling and solving a multi-period inventory fulfilling and routing problem for hazardous materials (Q2200132) (← links)
- A cutting plane method for risk-constrained traveling salesman problem with random arc costs (Q2274859) (← links)
- Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness (Q6114933) (← links)