The following pages link to (Q3292914):
Displaying 13 items.
- Branch and bound for the cutwidth minimization problem (Q339558) (← links)
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- Continuous time dynamic contraflow models and algorithms (Q1748504) (← links)
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs (Q1807930) (← links)
- Shortest paths algorithms: Theory and experimental evaluation (Q1919099) (← links)
- Optimal monotone relabelling of partially non-monotone ordinal data (Q2885460) (← links)
- Matching, Euler tours and the Chinese postman (Q4766817) (← links)
- Packing rooted directed cuts in a weighted directed graph (Q4769069) (← links)
- Validation of subgradient optimization (Q4770776) (← links)
- On the shortest path problem with negative cost cycles (Q5963684) (← links)
