Pages that link to "Item:Q1759849"
From MaRDI portal
The following pages link to A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849):
Displaying 10 items.
- MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
- Capacitated \(m\) two-node survivable star problem (Q325452) (← links)
- Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
- A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
- School bus routing—a column generation approach (Q4980002) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
