The following pages link to (Q4845366):
Displaying 17 items.
- The Traveling Salesman Problem with Distances One and Two (Q4697080) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- The moving-target traveling salesman problem (Q4820908) (← links)
- Gale's Round-Trip Jeep Problem (Q4845742) (← links)
- Traveling Salesperson Problems for the Dubins Vehicle (Q4974257) (← links)
- A Variable Neighborhood Search Algorithm for Cost-Balanced Travelling Salesman Problem (Q5011677) (← links)
- Separating clique tree and bipartition inequalities in polynomial time (Q5101404) (← links)
- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs (Q5302057) (← links)
- AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817) (← links)
- (Q5377934) (← links)
- A new integer programming formulation of the graphical traveling salesman problem (Q5918436) (← links)
- Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers (Q6048724) (← links)
- Automated slideshow design from a set of photos based on a hybrid Metaheuristic approach (Q6063787) (← links)
- Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
- A multi-algorithm approach for operational human resources workload balancing in a last mile urban delivery system (Q6551121) (← links)
- Routing one million customers in a handful of minutes (Q6551178) (← links)
- Optimizing combined tours: the truck-and-cargo-bike case (Q6581378) (← links)
