The following pages link to (Q4136942):
Displayed 14 items.
- Odd path packings (Q757435) (← links)
- Balanced optimization problems (Q760338) (← links)
- Probabilistic single processor scheduling (Q912611) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- On the use of augmenting chains in chain packings (Q1174179) (← links)
- The point-to-point delivery and connection problems: Complexity and algorithms (Q1193725) (← links)
- Paroids: A canonical format for combinatorial optimization (Q1199464) (← links)
- A variant of time minimizing assignment problem (Q1303581) (← links)
- A discrete model for studying existence and uniqueness of solutions in nonlinear resistive circuits (Q1326755) (← links)
- Minimum \(k\) arborescences with bandwidth constraints (Q1879251) (← links)
- Reducing horizontal linear complementarity problems (Q1894520) (← links)
- Ejection chains, reference structures and alternating path methods for traveling salesman problems (Q1917273) (← links)
- A particular timetable problem: Terminal scheduling (Q2276867) (← links)
- Using euler partitions to edge color bipartite multigraphs (Q4198790) (← links)