scientific article; zbMATH DE number 4064777
zbMATH Open0652.90085MaRDI QIDQ3798484FDOQ3798484
Authors: M. Sakarovitch 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
graphsheuristicstreesnetwork flowscutting planescoveringsmatchingsbranch-and-bounddiscrete optimizationLagrangian relaxationpolyhedral methodsEuler and Hamilton cycles
Linear programming (90C05) Programming involving graphs or networks (90C35) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Dynamic programming (90C39) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (23)
- Edge deletion preserving the diameter of the hypercube
- Title not available (Why is that?)
- Applications of combinatorial optimization
- Qualitative evaluation of production systems
- Concepts of combinatorial optimization
- Title not available (Why is that?)
- Generalization of the central-partition method
- Introduction to Invasive Weed Optimization Method
- Speedup and efficiency of large-size applications on heterogeneous networks
- Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(B\)-fairness and structural \(B\)-fairness in Petri net models of concurrent systems
- Solving a cutting problem based on existing patterns
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Title not available (Why is that?)
- Convexity and global optimization: A theoretical link
- Optimization techniques. Volume 2. Discrete and functional optimization
- Minimal cut cover of a graph with an application to the testing of electronic boards
- Combinatorial heuristic algorithms with FORTRAN
- On the properties of the subsets of a discrete domain defined by the local optimae of a function endowed with some geometrical properties
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798484)
