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)

Exact algorithms and applications for tree-like Weighted Set Cover
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
A relax-and-cut algorithm for the set partitioning problem
Multi-commodity supply network planning in the forest supply chain
Classical cuts for mixed-integer programming and branch-and-cut
A 0-1 integer linear programming approach to schedule outages of nuclear power plants
A mixed integer programming model for multiple stage adaptive testing
Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
Facets for the single node fixed-charge network set with a node set-up variable
Polyhedral results for the precedence-constrained knapsack problem
The constrained minimum spanning tree problem
New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem
The single-item lot-sizing polytope with continuous start-up costs and uniform production capacity
A unifying approach to heuristic search
The generalized assignment problem with minimum quantities
Evolution and state-of-the-art in integer programming
An exact algorithm for the maximum quasi‐clique problem
Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
A two-stage robust model for a reliable p-center facility location problem
An integer program for positive semidefinite zero forcing in graphs
Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
The sparse signomial classification and regression model
A distributed optimization approach via symmetric group actions under time-varying communication networks
On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
scientific article; zbMATH DE number 1357789 (Why is no real title available?)
A note on balancedness of dominating set games
An exact algorithm for the maximum stable set problem
Most recent changepoint detection in censored panel data
Assortment planning for multiple chain stores
A framework for generalized Benders' decomposition and its application to multilevel optimization
Decomposition of loosely coupled integer programs: a multiobjective perspective
Sequence independent lifting for a set of submodular maximization problems
Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Submodular function minimization and polarity
Extended Graph Formulation for the Inequity Aversion Pricing Problem on Social Networks
MILP approach to pattern generation in logical analysis of data
Integer programming models and polyhedral study for the geodesic classification problem on graphs
Polyhedral description of the integer single node flow set with constant bounds
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
Production-process optimization algorithm: application to fed-batch bioprocess
On properties of multi-dimensional statistical tables
Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
Testing balancedness and perfection of linear matrices
The rank pricing problem: models and branch-and-cut algorithms
Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
A matching algorithm for the distribution of human pancreatic islets
A cutting plane method for knapsack polytope
Implicit cover inequalities
Improving branch-and-cut performance by random sampling
On the core of routing games with revenues
Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis
Hooked on IP
Separating maximally violated comb inequalities in planar graphs
scientific article; zbMATH DE number 1423919 (Why is no real title available?)
Optimal consumption and arbitrage in incomplete, finite state security markets
A FPTAS for a class of linear multiplicative problems
Unbiasing in iterative reconstruction algorithms for discrete compressed sensing
Approximability of the firefighter problem. Computing cuts over time
Order cones: a tool for deriving \(k\)-dimensional faces of cones of subfamilies of monotone games
On the facet defining inequalities of the mixed-integer bilinear covering set
Integer programming ensemble of temporal relations classifiers
Coping with shortages caused by disruptive events in automobile supply chains
Combining progressive hedging with a Frank-Wolfe method to compute Lagrangian dual bounds in stochastic mixed-integer programming
Heuristic and exact algorithms for the precedence-constrained knapsack problem
Detecting critical node structures on graphs: a mathematical programming approach
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
Progress in presolving for mixed integer programming
A computational comparison of compact MILP formulations for the zero forcing number
Sequence independent lifting of cover inequalities
A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
Three methods for robust grading
scientific article; zbMATH DE number 1357793 (Why is no real title available?)
Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
Optimal schemes for combinatorial query problems with integer feedback
A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints
A primal heuristic for optimizing the topology of gas networks based on dual information
The maximum clique problem
Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1
A fast interactive solution method for large capital expenditure selection problems
Parallel best-first branch-and-bound in discrete optimization: a framework
Statistical methods in experimentation recommendation models for discovering gene regulation pathways
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
Describing global musical structures by integer programming on musical patterns
On coloring problems with local constraints
A review of operations research models in invasive species management: state of the art, challenges, and future directions
Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
Partial multicovering and the d-consecutive ones property
\(\mathrm{A}^\ast\) search for prize-collecting job sequencing with one common and multiple secondary resources
Solution of a certain class of network flow problems with cascaded demand aggregation and capacity allocation
Simulated annealing for single minimum optimization problems
Valid inequalities for quadratic optimisation with domain constraints
Enhancing CLP branch and bound techniques for scheduling problems
Polyhedral study of the capacitated vehicle routing problem
Conservative scales in packing problems

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)