Pages that link to "Item:Q5378639"
From MaRDI portal
The following pages link to Solution of a Large-Scale Traveling-Salesman Problem (Q5378639):
Displaying 50 items.
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Modeling supermarket re-layout from the owner's perspective (Q271919) (← links)
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
- The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm (Q320620) (← links)
- The traveling salesman problem with time-dependent service times (Q320683) (← links)
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- Calibrating cross-training to meet demand mix variation and employee absence (Q320699) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- A new mathematical programming formulation for the single-picker routing problem (Q323113) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- Multiple asymmetric traveling salesmen problem with and without precedence constraints: performance comparison of alternative formulations (Q337114) (← links)
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
- Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- A bi-objective model for the used oil location-routing problem (Q337643) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- A new heuristic for detecting non-Hamiltonicity in cubic graphs (Q342098) (← links)
- Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
- A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
- Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
- An extended approach for lifting clique tree inequalities (Q498425) (← links)
- An effective heuristic for the \(P\)-median problem with application to ambulance location (Q505139) (← links)
- Minisum and maximin aerial surveillance over disjoint rectangles (Q518456) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- A diagonal completion and 2-optimal procedure for the travelling salesman problem (Q583126) (← links)
- Distance conserving reductions for nonoriented networks (Q594774) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- (Q5075801) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- Hidden Hamiltonian Cycle Recovery via Linear Programming (Q5130484) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Multidistances and inequality measures on abstract sets: an axiomatic approach (Q6058096) (← links)
- “Make no little plans”: Impactful research to solve the next generation of transportation problems (Q6065303) (← links)
- Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule (Q6065592) (← links)
- The family traveling salesman problem with incompatibility constraints (Q6065853) (← links)
- The <i>r</i>‐interdiction selective multi‐depot vehicle routing problem (Q6067891) (← links)
- Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)
- A biased random-key genetic algorithm for the two-level hub location routing problem with directed tours (Q6073277) (← links)
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems (Q6079856) (← links)
- Heuristic sequencing methods for time optimal tracking of nested, open and closed paths (Q6084144) (← links)
- The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
