scientific article; zbMATH DE number 193411

zbMATH Open0652.90067MaRDI QIDQ4040221FDOQ4040221

Authors: G. L. Nemhauser, Laurence A. Wolsey 

Publication date: 5 June 1993

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1312984
• scientific article; zbMATH DE number 193499
• Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
• Publication:4729618
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)

zbMATH Keywords

computational complexitymatchingdualityfacetsrelaxationseparationsubmodular functionvalid inequalitiesdiscrete optimizationpolynomial-time algorithmsbasis reduction

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Integer programming (90C10) Polytopes and polyhedra (52Bxx) Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cited In (only showing first 100 items - show all)

• The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
• The generalized assignment problem with minimum quantities
• Most recent changepoint detection in censored panel data
• The sparse signomial classification and regression model
• Implicit cover inequalities
• Improving branch-and-cut performance by random sampling
• The maximum clique problem
• PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
• Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
• Parallelization of the FICO Xpress-Optimizer
• Adapting polyhedral properties from facility to hub location problems
• A branch and bound method for stochastic integer problems under probabilistic constraints
• Locating stops along bus or railway lines -- a bicriteria problem
• A mixed integer programming approach to multi-skilled workforce scheduling
• Optimization-based heuristics for underground mine scheduling
• A purely proactive scheduling procedure for the resource-constrained project scheduling problem with stochastic activity durations
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Benders decomposition for the uncapacitated multiple allocation hub location problem
• The single allocation problem in the interacting three-hub network
• Routing traffic at hub facilities
• Design of manufacturing systems using queueing models
• Valid inequalities for mixed integer linear programs
• Integer-programming software systems
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems
• Dynamic programming approximation algorithms for the capacitated lot-sizing problem
• Decomposition and mean-field approach to mixed integer optimal compensation problems
• A new mathematical model for tiling finite regions of the plane with polyominoes
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
• Dual decomposition in stochastic integer programming
• The complexity of cover inequality separation
• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• A projection method for \(l_ p\) norm location-allocation problems
• Cutting planes for the multistage stochastic unit commitment problem
• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
• Total variation bounds on the expectation of periodic functions with applications to recourse approximations
• Tight LP‐based lower bounds for wavelength conversion in optical networks
• Practical issues on the projection of polyhedral sets
• A polyhedral study of production ramping
• Approximation algorithms for multi-index transportation problems with decomposable costs
• Finding the minimum weight IIS cover of an infeasible system of linear inequalities
• A method for the cutting stock problem with different qualities
• On approximately fair cost allocation in Euclidean TSP games
• Computing generating sets of lattice ideals and Markov bases of lattices
• Boolean-controlled systems via receding horizon and linear programing
• The expressive power of binary submodular functions
• The \(k\)-regular induced subgraph problem
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
• Routing of uncertain traffic demands
• Convex envelopes generated from finitely many compact convex sets
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs
• Explicit convex and concave envelopes through polyhedral subdivisions
• Solving \(0/1\) integer programs with enumeration cutting planes
• The one-warehouse multi-retailer problem: reformulation, classification, and computational results
• Optimizing over the first Chvátal closure
• LP models for bin packing and cutting stock problems
• Mixed-integer programming models for nesting problems
• Equilibrium relations in a capital asset market: A mean absolute deviation approach
• On stochastic dynamic programming for solving large-scale planning problems under uncertainty
• A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
• Algebraic connectivity of an even uniform hypergraph
• Surrogate gradient algorithm for Lagrangian relaxation
• The Steiner tree polytope and related polyhedra
• The modified integer round-up property of the one-dimensional cutting stock problem
• On the dimension of projected polyhedra
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Minimum cost capacity installation for multicommodity network flows
• Computational study of a family of mixed-integer quadratic programming problems
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• Generalized mixed integer rounding inequalities: Facets for infinite group polyhedra
• Convex approximations for complete integer recourse models
• A simultaneous inventory control and facility location model with stochastic capacity constraints
• The maximum vertex coverage problem on bipartite graphs
• Mixed integer models for the stationary case of gas network optimization
• Separation algorithms for 0-1 knapsack polytopes
• Two row mixed-integer cuts via lifting
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem
• Integration of progressive hedging and dual decomposition in stochastic integer programs
• Rational approximation of vertical segments
• Convergence properties of the cross-entropy method for discrete optimization
• On resolving simultaneous congruences using belief propagation
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• MSO: a framework for bound-constrained black-box global optimization algorithms
• A cutting plane algorithm for graph coloring
• On valid inequalities for mixed integer \(p\)-order cone programming
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• A branch-and-cut algorithm for graph coloring
• Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
• Lower and upper bounds for the degree-constrained minimum spanning tree problem
• A polyhedral study of the semi-continuous knapsack problem
• Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs
• Sequential pairing of mixed integer inequalities
• A class of stochastic programs with decision dependent uncertainty
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• The maximum-leaf spanning tree problem: Formulations and facets
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
• The constrained minimum spanning tree problem

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 Q4040221)