scientific article

zbMath0652.90085MaRDI QIDQ3798484

M. Sakarovitch

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

heuristicsLagrangian relaxationbranch-and-boundgraphstreesmatchingscoveringsnetwork flowscutting planesdiscrete optimizationpolyhedral methodsEuler and Hamilton cycles

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (12)

Solving a cutting problem based on existing patterns ⋮ Edge deletion preserving the diameter of the hypercube ⋮ An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock ⋮ Unnamed Item ⋮ Qualitative evaluation of production systems ⋮ Speedup and efficiency of large-size applications on heterogeneous networks ⋮ Introduction to Invasive Weed Optimization Method ⋮ \(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 ⋮ Convexity and global optimization: A theoretical link ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods ⋮ On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties

This page was built for publication: