Pages that link to "Item:Q3050130"
From MaRDI portal
The following pages link to Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium (Q3050130):
Displaying 14 items.
- Boolean Elements in Combinatorial Optimization (Q3050131) (← links)
- Matroid Intersection (Q3205244) (← links)
- Packing Problems and Hypergraph Theory: A Survey (Q3859781) (← links)
- Shortest Path and Network Flow Algorithms (Q3901333) (← links)
- Graph Theory and Integer Programming (Q4193501) (← links)
- Covering, Packing and Knapsack Problems (Q4194731) (← links)
- Travelling Salesman and Assignment Problems: A Survey (Q4196459) (← links)
- Cutting Stock, Linear Programming, Knapsacking, Dynamic Programming and Integer Programming, Some Interconnections (Q4197625) (← links)
- Computational Complexity of Discrete Optimization Problems (Q4198060) (← links)
- Approximative Algorithms for Discrete Optimization Problems (Q4198337) (← links)
- Use of Floyd'S Algorithm to Find Shortest Restricted Paths (Q4198356) (← links)
- The Role of Unimodularity in Applying Linear Inequalities to Combinatorial Theorems (Q4198768) (← links)
- Blocking and Antiblocking Polyhedra (Q4198784) (← links)
- Report of the Session on Algorithms for Special Classes of Combinatorial Optimization Problems (Q4199521) (← links)
