scientific article
From MaRDI portal
Publication:3686494
zbMath0568.90061MaRDI QIDQ3686494
Manfred W. Padberg, Karla L. Hoffman
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polyhedral theorysymmetric traveling salesmancombinatorial problem solvingoptimal triangulation of input/output matricestutorial outline
Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Polytopes and polyhedra (52Bxx)
Related Items (16)
S3 sets. An extension of the Beale-Tomlin special ordered sets ⋮ Nonconvex optimization over a polytope using generalized capacity improvement ⋮ Strategies for LP-based solving a general class of scheduling problems ⋮ Discrete optimization in public rail transport ⋮ Some properties of cliques in 0-1 mixed integer programs ⋮ Strong formulations for mixed integer programming: A survey ⋮ A production planning problem in FMS ⋮ Constraint Generation and Surrogate Relaxation ⋮ An analytical comparison of different formulations of the travelling salesman problem ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ A computational study of several heuristics for the DRPP ⋮ \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates ⋮ Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing ⋮ On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs ⋮ Facets and algorithms for capacitated lot sizing ⋮ Order selection on a single machine with high set-up costs
This page was built for publication:
