Publication:3798484

zbMath0652.90085MaRDI QIDQ3798484

M. Sakarovitch

Publication date: 1984

zbMATH Keywords

heuristics; Lagrangian relaxation; branch-and-bound; graphs; trees; matchings; coverings; network flows; cutting planes; discrete optimization; polyhedral methods; Euler and Hamilton cycles

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

90C10: Integer programming

90C05: Linear programming

90B35: Deterministic scheduling theory in operations research

90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

90C39: Dynamic programming

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

Related Items

Speedup and efficiency of large-size applications on heterogeneous networks, \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems, Minimal cut cover of a graph with an application to the testing of electronic boards, Solving a cutting problem based on existing patterns, An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock, On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties, Edge deletion preserving the diameter of the hypercube, Qualitative evaluation of production systems