scientific article; zbMATH DE number 193411

MaRDI QIDQ4040221zbMATH OpenFDO

Authors G. L. Nemhauser, Laurence A. Wolsey

Publication date 5 June 1993

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)

Cited in

(only showing first 100 items - show all)

Equilibrium relations in a capital asset market: A mean absolute deviation approach
Minimizing total tardiness on a single machine with controllable processing times
Reconstructing (0,1)-matrices from projections using integer programming
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
A new lower bound for the single row facility layout problem
A ring-mesh topology design problem for optical transport networks
On stochastic dynamic programming for solving large-scale planning problems under uncertainty
A branching scheme for finding cost-minimal round robin tournaments
A hybrid algorithm for the unbounded knapsack problem
A geometric characterization of ``optimality-equivalent relaxations
Red-blue covering problems and the consecutive ones property
A matching algorithm for the distribution of human pancreatic islets
A Lagrangian-based algorithm for a multiple depot, multiple traveling salesmen problem
Multi-commodity supply network planning in the forest supply chain
MILP approach to pattern generation in logical analysis of data
Cliques, holes and the vertex coloring polytope
Airline network revenue management by multistage stochastic programming
On the complexities of selected satisfiability and equivalence queries over Boolean formulas and inclusion queries over hulls
The submodular knapsack polytope
Optimizing glass coating lines: MIP model and valid inequalities
Heuristics for the 0-1 multidimensional knapsack problem
Models for concurrent product and process design
\(O(n \log n)\) procedures for tightening cover inequalities
The modified integer round-up property of the one-dimensional cutting stock problem
Search-hide games on trees
A reference direction approach to multiple objective integer linear programming
Performance modeling and optimization of networks of bridged LANs
Facets of two Steiner arborescence polyhedra
An interior point algorithm to solve computationally difficult set covering problems
Mathematical programs with a two-dimensional reverse convex constraint
An approximate method for local optima for nonlinear mixed integer programming problems
A review of open queueing network models of manufacturing systems
Design of manufacturing systems using queueing models
Polyhedral results for the precedence-constrained knapsack problem
Solving to optimality the uncapacitated fixed-charge network flow problem
Optimizing solid waste collection in Brussels
On the dimension of projected polyhedra
A linear program for the two-hub location problem
Optimal lines for railway systems
New inequalities for the general routing problem
Facets for node packing
Optimal scrap combination for steel production
Surrogate gradient algorithm for Lagrangian relaxation
Weak k-majorization and polyhedra
Minimum cost capacity installation for multicommodity network flows
Condition measures and properties of the central trajectory of a linear program
Discrete convex analysis
L-shaped decomposition of two-stage stochastic programs with integer recourse
Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
Capacity planning for phased implementation of flexible manufacturing systems under budget restrictions
Network-based formulations of the quadratic assignment problem
Optimal television schedules in alternative competitive environments
The rural postman problem with deadline classes
Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
On a multiconstrained model for chromatic scheduling
Calculating uncertainty intervals in approximate equation systems
Multistage hybrid flowshop scheduling with identical jobs and uniform parallel machines
A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
Integrated defect detection and optimization for cross cutting of wooden boards
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem
A catalog of minimally nonideal matrices
On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse.
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
On surrogating 0-1 knapsack constraints
A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Dual decomposition in stochastic integer programming
The partial constraint satisfaction problem: Facets and lifting theorems
Lifting theorems and facet characterization for a class of clique partitioning inequalities
On dependent randomized rounding algorithms
The 2-hop spanning tree problem
The complexity of cover inequality separation
Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property: An investigation of generation mechanism
Algorithms for a multi-level network optimization problem
Order selection on a single machine with high set-up costs
Boolean polynomials and set functions
Optimal consumption and arbitrage in incomplete, finite state security markets
A deep cut ellipsoid algorithm for convex programming: Theory and applications
A new global approach for \(0\)-\(1\) polynomial programs
The maximum clique problem
Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems
Min-cut clustering
The Steiner tree polytope and related polyhedra
An exact algorithm for the maximum stable set problem
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
A global approach for general 0-1 fractional programming
Arborescence polytopes for series-parallel graphs
Partial cover and complete cover inequalities
Efficient inference in Bayes networks as a combinatorial optimization problem
On weighted multiway cuts in trees
A projection method for \(l_ p\) norm location-allocation problems
Solving \(0/1\) integer programs with enumeration cutting planes
Vertex packing problem application to the design of electronic testing fixtures
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem
A distance constrained p-facility location problem on the real line
A surrogate heuristic for set covering problems
Supernode processing of mixed-integer models
A comparison of \(p\)-dispersion heuristics
Practical issues on the projection of polyhedral sets

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)