Pages that link to "Item:Q3386757"
From MaRDI portal
The following pages link to On Solving the Quadratic Shortest Path Problem (Q3386757):
Displaying 10 items.
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- On the analysis of optimization problems in arc-dependent networks (Q2172089) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- Linearizable special cases of the quadratic shortest path problem (Q2672440) (← links)
- Coastline matching via a graph-based approach (Q2677371) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs (Q6044986) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)
- Arc-dependent networks: theoretical insights and a computational study (Q6588520) (← links)
