Chapter
Chapter 2. Packing problems
pp.：
24 – 32
Chapter 3. Admissible transformations and their application to matching problems
pp.：
32 – 48
Chapter 4. Polynomial algorithms for totally dual integral systems and extensions
pp.：
48 – 62
Chapter 5. Minimal costreliability ratio spanning tree
pp.：
62 – 70
Chapter 6. A graph theoretic analysis of bounds for the quadratic assignment problem
pp.：
70 – 78
Chapter 7. An investigation of algorithms used in the restructuring of linear programming basis matrices prior to inversion
pp.：
78 – 104
Chapter 8. On the number of nonnegative integer solutions of a system of linear diophantine equations
pp.：
104 – 118
Chapter 9. The administration of standard length telephone cable reels
pp.：
118 – 134
Chapter 10. Threshold numbers and threshold completions
pp.：
134 – 156
Chapter 11. Constrained location and the Weber–Rawls problem
pp.：
156 – 176
Chapter 12. A bounding technique for integer linear programming with binary variables
pp.：
176 – 186
Chapter 13. School timetables
pp.：
186 – 198
Chapter 14. How to color claw-free perfect graphs
pp.：
198 – 208
Chapter 15. Properties of some extremal problems of permutation cycles
pp.：
208 – 224
Chapter 16. Minimal test set for diagnosing a tree system
pp.：
224 – 250
Chapter 17. Sufficient conditions for graphs to have threshold number 2
pp.：
250 – 278
Chapter 18. Optimum synthesis of a network with non-simultaneous multicommodity flow requirements
pp.：
278 – 288
Chapter 19. Maximizing submodular set functions: formulations and analysis of algorithms
pp.：
288 – 312
Chapter 20. A solvable machine maintenance model with applications
pp.：
312 – 322
Chapter 21. Convergence of decomposition algorithms for the traffic assignment problem
pp.：
322 – 328
Chapter 22. A recursive method for solving assignment problems
pp.：
328 – 354
Chapter 23. Asymptotical estimations for the number of cliques of uniform hypergraphs
pp.：
354 – 368
Chapter 24. A suggested extension of special ordered sets to non-separable non-convex programming problems
pp.：
368 – 380
Chapter 25. Parametric multicriteria integer programming
pp.：
380 – 390
Chapter 26. Scheduling in sports
pp.：
390 – 406
Studies on Graphs and Discrete Programming
( Volume 11 )
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
