Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979)

zbMath0484.68028MaRDI QIDQ1163859

No author found.

Publication date: 1981

Published in: CISM International Centre for Mechanical Sciences. Courses and Lectures (Search for Journal in Brave)

zbMATH Keywords

matroid optimizationNP-complete optimization problemspolymatroidal network flowsalgorithms for generating permutationsapproximation algorithms for bin packing problemsbasic data structures for combinatorial problemsconvex optimization problems associated to an NP-complete setgroup theoretical approach to integer programmingimplementation of enumerative methodsmultidimensional memoriesoptimum weighted spanning treesreductions among combinatorial problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Integer programming (90C10) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Deterministic network models in operations research (90B10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Combinatorial aspects of packing and covering (05B40) Discrete mathematics in relation to computer science (68Rxx)

Related Items

A 71/60 theorem for bin packing ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ An application of simulated annealing to the cutting stock problem ⋮ A one-dimensional cutting stock problem in the aluminium industry and its solution ⋮ A typology of cutting and packing problems ⋮ Online bin packing with advice of small size