Pages that link to "Item:Q1754341"
From MaRDI portal
The following pages link to The quadratic shortest path problem: complexity, approximability, and solution methods (Q1754341):
Displayed 13 items.
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Variable-sized uncertainty and inverse problems in robust optimization (Q1694311) (← links)
- Generating constrained length personalized bicycle tours (Q1728418) (← links)
- Special cases of the quadratic shortest path problem (Q1743483) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights (Q2108190) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
- A linear time algorithm for linearizing quadratic and higher-order shortest path problems (Q6086024) (← links)