scientific article; zbMATH DE number 3559278
From MaRDI portal
Publication:4132247
zbMath0358.90035MaRDI QIDQ4132247
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Integer programming (90C10) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Representability in mixed integer programming. I: Characterization results, Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems, A simplification for some disjunctive formulations, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, A hierarchy of relaxations for linear generalized disjunctive programming, Foundation-penalty cuts for mixed-integer programs., A finitely convergent procedure for facial disjunctive programs, Chvátal closures for mixed integer programming problems, Degeneracy removal in cutting plane methods for disjoint bilinear programming, Strong valid inequalities for fluence map optimization problem under dose-volume restrictions, Lift-and-project for mixed 0-1 programming: recent progress, Cutting planes in integer and mixed integer programming, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Elementary closures for integer programs., A converse for disjunctive constraints, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Cutting-plane theory: Algebraic methods, Two mixed integer programming formulations arising in manufacturing management, Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation, Future paths for integer programming and links to artificial intelligence, Representability of functions, On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs, Duality in disjunctive linear fractional programming, Projection, lifting and extended formulation integer and combinatorial optimization
