The following pages link to (Q4890614):
Displaying 9 items.
- Polyhedral study of the connected subgraph problem (Q468440) (← links)
- Polyhedra with high-density graphs and polynomial-time solvability of combinatorial optimization problems (Q1324027) (← links)
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- A computational complexity comparative study of graph tessellation problems (Q2222093) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
- (Q3673577) (← links)
- (Q3832321) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes (Q5454268) (← links)