Pages that link to "Item:Q2434982"
From MaRDI portal
The following pages link to The symmetric quadratic traveling salesman problem (Q2434982):
Displaying 19 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- An extended approach for lifting clique tree inequalities (Q498425) (← links)
- Linear models and computational experiments for the quadratic TSP (Q510950) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- The maximum travelling salesman problem on symmetric Demidenko matrices (Q1962061) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem (Q2479572) (← links)
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
- A Polyhedral Study of the Quadratic Traveling Salesman Problem (Q2806910) (← links)
- (Q4263707) (← links)
- Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times (Q4994167) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems (Q6180041) (← links)
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization (Q6665386) (← links)