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)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
- Polyhedral description of the integer single node flow set with constant bounds
- Valid Inequalities for the Pooling Problem with Binary Variables
- The clique partitioning problem: Facets and patching facets
- An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line
- Asymptotic independence of servers' activity in queueing systems with limited resource pooling
- Impact of fairness and heterogeneity on delays in large-scale centralized content delivery systems
- Shortest-path network interdiction
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- A lexicographic semiorder polytope and probabilistic representations of choice
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines
- Double system parts optimization: static and dynamic model
- Local convex hulls for a special class of integer multicommodity flow problems
- Estimating the strength of poker hands by integer linear programming techniques
- Solving disjunctive optimization problems by generalized semi-infinite optimization techniques
- Duality for mixed-integer convex minimization
- On the behavior of the \(N_{+}\)-operator under blocker duality
- A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
- Forecast horizons and dynamic facility location planning
- Ideal clutters
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- On sublinear inequalities for mixed integer conic programs
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern
- Multi-level facility location as the maximization of a submodular set function
- A cutting plane algorithm for the capacitated facility location problem
- Global solution of optimization problems with signomial parts
- A bidirected generalization of network matrices
- Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines
- Solving planning and design problems in the process industry using mixed integer and global optimization
- Aggregation heuristic for the open-pit block scheduling problem
- An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters
- An integer programming approach for solving the \(p\)-dispersion problem
- Allocation of flows in closed bipartite queueing networks
- Supplier selection in the processed food industry under uncertainty
- A heuristic to generate rank-1 GMI cuts
- The combinatorial bandwidth packing problem
- An interior point algorithm to solve computationally difficult set covering problems
- Facets of two Steiner arborescence polyhedra
- Mixed integer linear models for the optimization of dynamical transport networks
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
- A polyhedral approach to the stability of a family of coalitions
- Optimal lines for railway systems
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A catalog of minimally nonideal matrices
- A global approach for general \(0-1\) fractional programming
- Piece-wise linear approximation of functions of two variables
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Locating active sensors on traffic networks
- A two-stage stochastic programming approach for project planning with uncertain activity durations
- Conic mixed-integer rounding cuts
- Tool capacity planning for semiconductor fabrication facilities under demand uncertainty
- Nonconvex, lower semicontinuous piecewise linear optimization
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- A new lower bound for the single row facility layout problem
- Mingling: mixed-integer rounding with bounds
- Heuristics for the 0-1 multidimensional knapsack problem
- Sample-path optimization of convex stochastic performance functions
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
- Mixed integer programming models for dispatching vehicles at a container terminal
- A review of open queueing network models of manufacturing systems
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
- Facets for node packing
- New inequalities for the general routing problem
- Solving the anti-covering location problem using Lagrangian relaxation
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- A branch-and-cut algorithm for the ring spur assignment problem
- An approximate method for local optima for nonlinear mixed integer programming problems
- Min-cut clustering
- An algorithmic framework for tool switching problems with multiple objectives
- Split cuts and extended formulations for mixed integer conic quadratic programming
- Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
- Approximating separable nonlinear functions via mixed zero-one programs
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
- The assignment and loading transportation problem
- Rounding-based heuristics for nonconvex MINLPS
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
- Using mixed-integer programming to solve power grid blackout problems
- Polyhedra for lot-sizing with Wagner-Whitin costs
- Notes on polyhedra associated with hop-constrained paths
- Conditional value-at-risk in stochastic programs with mixed-integer recourse
- Circulation of railway rolling stock: a branch-and-price approach
- Min-up/min-down polytopes
- Metaheuristics: A bibliography
- ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
- Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
- Mathematical optimization ideas for biodiversity conservation
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
- The selection and scheduling of telecommunication calls with time windows
- Solving the vehicle routing problem with stochastic demands using the cross-entropy method
- Optimal timeslot and channel allocation considering fairness for multicell CDMA/TDD systems
- Airport management: taxi planning
- An algorithm for optimizing a linear function over an integer efficient set
- On the facets of mixed integer programs with two integer variables and two constraints
- A 0-1 integer linear programming approach to schedule outages of nuclear power plants
- Facets for the single node fixed-charge network set with a node set-up variable
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)
