Pages that link to "Item:Q1411627"
From MaRDI portal
The following pages link to Easy and difficult objective functions for max cut (Q1411627):
Displaying 17 items.
- Single-commodity robust network design with finite and hose demand sets (Q291071) (← links)
- Bilevel programming and the separation problem (Q403662) (← links)
- Partitioning planar graphs: a fast combinatorial approach for max-cut (Q434180) (← links)
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks (Q987811) (← links)
- Forming \(k\) coalitions and facilitating relationships in social networks (Q1647520) (← links)
- The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
- Patience of matrix games (Q2444536) (← links)
- Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty (Q3386790) (← links)
- Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty (Q4994141) (← links)
- Tight Cycle Relaxations for the Cut Polytope (Q5020841) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- The Bipartite QUBO (Q5050150) (← links)
- The Rank-One Quadratic Assignment Problem (Q5085471) (← links)
- Quantum Annealing versus Digital Computing (Q5102052) (← links)
- Minimum Cuts in Surface Graphs (Q5885599) (← links)
