The following pages link to (Q3425132):
Displaying 50 items.
- Concorde (Q16936) (← links)
- Compact formulations of the Steiner traveling salesman problem and related problems (Q257227) (← links)
- Flexible pair-copula estimation in D-vines using bivariate penalized splines (Q261005) (← links)
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- Integer programming formulations for the elementary shortest path problem (Q322844) (← links)
- The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
- An optimal path planning problem for heterogeneous multi-vehicle systems (Q326212) (← links)
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- Dynamic design of sales territories (Q337456) (← links)
- Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm (Q342250) (← links)
- Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- Physical portrayal of computational complexity (Q408483) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- Instance-specific multi-objective parameter tuning based on fuzzy logic (Q439495) (← links)
- Certifying algorithms (Q465678) (← links)
- Strong-branching inequalities for convex mixed integer nonlinear programs (Q480939) (← links)
- Improved filtering for weighted circuit constraints (Q487627) (← links)
- Algorithm runtime prediction: methods \& evaluation (Q490455) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Integer linear programming for the Bayesian network structure learning problem (Q511785) (← links)
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- Scaling laws for maximum coloring of random geometric graphs (Q516873) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← 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)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- The travelling salesman problem and adiabatic quantum computation: an algorithm (Q670009) (← links)
- Efficiently embedding QUBO problems on adiabatic quantum computers (Q670075) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
- A minimum spanning tree based heuristic for the travelling salesman tour (Q724377) (← links)
- Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
- Reformulating the disjunctive cut generating linear program (Q827289) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
