scientific article; zbMATH DE number 193411
From MaRDI portal
Publication:4040221
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
computational complexitymatchingdualityfacetsrelaxationseparationsubmodular functionvalid inequalitiesdiscrete optimizationpolynomial-time algorithmsbasis reduction
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)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
- Polyhedral results for the precedence-constrained knapsack problem
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- Evolution and state-of-the-art in integer programming
- Assortment planning for multiple chain stores
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
- An exact algorithm for the maximum stable set problem
- A cutting plane method for knapsack polytope
- Approximability of the firefighter problem. Computing cuts over time
- Methods based on discrete optimization for finding road network rehabilitation strategies
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A primal heuristic for optimizing the topology of gas networks based on dual information
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- A stochastic integer programming model for incorporating day-ahead trading of electricity into hydro-thermal unit commitment
- Decomposition of integer matrices and multileaf collimator sequencing
- A Lagrangian-based algorithm for a combinatorial motion planning problem
- Parametric linear programming and cluster analysis
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Acceleration of cutting-plane and column generation algorithms: Applications to network design
- Budgeted Matching and Budgeted Matroid Intersection Via the Gasoline Puzzle
- A branch-and-price-and-cut algorithm for the pattern minimization problem
- Hybrid systems modeling and control
- Coordinated scheduling of customer orders for quick response
- Challenges in Enterprise Wide Optimization for the Process Industries
- Exact algorithms for minimum routing cost trees
- Comparison of Sampling Methods for Dynamic Stochastic Programming
- Column-Generation in Integer Linear Programming
- The 2-path network problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Integer programming methods for large-scale practical classroom assignment problems
- Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem
- A branch-and-cut algorithm for the maximum benefit Chinese postman problem
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Scheduling arc maintenance jobs in a network to maximize total flow over time
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal control of plotting and drilling machines: A case study
- Maximum utility product pricing models and algorithms based on reservation price
- An implementation of exact knapsack separation
- A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders
- Revising history for cost-informed process improvement
- A parallel hybrid greedy branch and bound scheme for the maximum distance-2 matching problem
- Solving quality control problems with an algorithm for minimax programs with coupled constraints
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
- A two-phase adaptive variable neighborhood approach for nurse rostering
- Modelling and planning public cultural schedules for efficient use of resources
- A unified approach to approximating partial covering problems
- Models and solution techniques for frequency assignment problems
- Optimization for a special class of traffic flow models: combinatorial and continuous approaches
- Approximation algorithms for finding low-degree subgraphs
- The traveling salesman problem with pickup and delivery: Polyhedral results and a branch-and-cut algorithm
- Decision support system for mass dispensing of medications for infectious disease outbreaks and bioterrorist attacks
- A catalog of steiner tree formulations
- Two-stage stochastic programming supply chain model for biodiesel production via wastewater treatment
- On cardinality constrained cycle and path polytopes
- On the equivalence of strong formulations for capacitated multi-level lot sizing problems with setup times
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- On compact formulations for integer programs solved by column generation
- Optimizing experimental design in genetics
- Computing sparse and dense realizations of reaction kinetic systems
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- Pre-emptive scheduling problems with controllable processing times
- A survey of dynamic network flows
- Minimizing total tardiness on a single machine with controllable processing times
- Restricted b‐factors in bipartite graphs and t‐designs
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
- On a Multi-stage Stochastic Programming Model for Inventory Planning
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- A quantitative analysis of container vessel arrival planning strategies
- Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times
- The submodular knapsack polytope
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Static and dynamic source locations in undirected networks
- MIR closures of polyhedral sets
- Bilevel Integer Programs with Stochastic Right-Hand Sides
- Parallel machine scheduling with job assignment restrictions
- Optimizing solid waste collection in Brussels
- Weak \(k\)-majorization and polyhedra
- Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
- Lifting theorems and facet characterization for a class of clique partitioning inequalities
- A comparison of \(p\)-dispersion heuristics
- Airline network revenue management by multistage stochastic programming
- Projected Chvátal-Gomory cuts for mixed integer linear programs
- Alternative formulations for the set packing problem and their application to the winner determination problem
- A reference direction approach to multiple objective integer linear programming
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
- Obtaining tighter relaxations of mathematical programs with complementarity constraints
- The 2-hop spanning tree problem
- A distance constrained \(p\)-facility location problem on the real line
- Stochastic survivable network design problems: theory and practice
- Facets and algorithms for capacitated lot sizing
- A cutting plane algorithm for the unrelated parallel machine scheduling problem
- Hybrid metaheuristics: an introduction
- Stable matching with proportionality constraints
- Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
- Efficient solution methods for a general \(r\)-interdiction median problem with fortification
- A triplet-based exact method for the shift minimisation personnel task scheduling 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)
