scientific article
From MaRDI portal
Publication:3914755
zbMath0463.90063MaRDI QIDQ3914755
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation methodsbranch and boundtransportation problemsdiscrete optimizationKnapsack problemimplicit enumerationinteger polyhedraelementary textbookconvex symmetric programmingdiophantine programmingpacking, traveling salesmansequential selection methods
Deterministic scheduling theory in operations research (90B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx)
Related Items (14)
Finding the maximal internally stable set of a graph ⋮ A priori determination of bounds for the optimal value of variables in integer linear programming problems ⋮ Optimization theory on antichains with the Steinitz exchange property ⋮ Aggregation of linear integer equations ⋮ Gradient methods of maximization of convex functions on discrete structures ⋮ An algorithm finding p-medians of a graph ⋮ Discrete extremal problems ⋮ Conflict-free allocation of arrays during parallel computations ⋮ Polyhedral aspects of discrete optimization ⋮ The common face of some 0/1-polytopes with NP-complete nonadjacency relation ⋮ Algorithms for sequential analysis and fathoming in discrete optimization problems ⋮ Method for finding a general expression for the integer-valued solutions of a system of linear inequalities ⋮ Econometric modeling using ``Goodness of fit of behavior ⋮ Optimization of integrated multiprogramming in computer systems with different configurations
This page was built for publication:
