Pages that link to "Item:Q4291501"
From MaRDI portal
The following pages link to A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph (Q4291501):
Displaying 12 items.
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- Lower bounding techniques for frequency assignment (Q1292811) (← links)
- A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
- Generation of lower bounds for minimum span frequency assignment (Q1602703) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- A \(\frac78\)-approximation algorithm for metric Max TSP (Q1847381) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- An approximation algorithm for maximum triangle packing (Q2492197) (← links)
- A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
