scientific article; zbMATH DE number 1131473
From MaRDI portal
Publication:4382664
zbMath0899.90138MaRDI QIDQ4382664
No author found.
Publication date: 22 March 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items
The Boolean Quadric Polytope, A lower bound for the non-oriented two-dimensional bin packing problem, On the approximation of the minimum disturbance \(p\)-facility location problem, DASH: dynamic approach for switching heuristics, A survey for the quadratic assignment problem, Models and algorithms for three-stage two-dimensional bin packing, A continuous bi-level model for the expansion of highway networks, Cuts, matrix completions and graph rigidity, Arc-flow model for the two-dimensional guillotine cutting stock problem, Study of the pedigree polytope and a sufficiency condition for nonadjacency in the tour polytope, A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments, Algorithms and codes for dense assignment problems: The state of the art, Cardinality constrained minimum cut problems: complexity and algorithms., A hierarchical location model for public facility planning, A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, On pedigree polytopes and Hamiltonian cycles, Classes of quadratic assignment problem instances: Isomorphism and difficulty measure using a statistical approach, Packing Problems in Space Solved by CPLEX: An Experimental Analysis, Model Development and Optimization for Space Engineering: Concepts, Tools, Applications, and Perspectives
