The following pages link to On minimum reload cost cycle cover (Q496639):
Displaying 16 items.
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- The quadratic cycle cover problem: special cases and efficient bounds (Q2175054) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- On the complexity of constructing minimum changeover cost arborescences (Q2453161) (← links)
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
- On minimum reload cost cycle cover (Q2883554) (← links)
- Reload cost trees and network design (Q2913949) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- (Q5111862) (← links)
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (Q5232142) (← links)
- Minimum reload cost cycle cover in complete graphs (Q5241427) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- Minimum reload cost graph factors (Q5918369) (← links)
- Constructing minimum changeover cost arborescenses in bounded treewidth graphs (Q5964020) (← links)
- Parameterized complexity of finding a spanning tree with minimum reload cost diameter (Q6087398) (← links)
