scientific article; zbMATH DE number 1416629
From MaRDI portal
Publication:4943600
zbMATH Open0944.90001MaRDI QIDQ4943600FDOQ4943600
Authors: G. L. Nemhauser, Laurence A. Wolsey 
Publication date: 19 March 2000
Title of this publication is not available (Why is that?)
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)
- A cross entropy algorithm for the Knapsack problem with setups
- Exact algorithms for inventory constrained scheduling on a single machine
- The sociotechnical teams formation problem: a mathematical optimization approach
- Fast algorithms for the undirected negative cost cycle detection problem
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- School choice with controlled choice constraints: hard bounds versus soft bounds
- Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem
- Knapsack polytopes: a survey
- Global solution of bilevel programs with a nonconvex inner program
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem
- Spectral compressive sensing
- A computational study of a cutting plane algorithm for university course timetabling
- Two-stage stochastic mixed-integer programs: algorithms and insights
- Minimum k‐cores and the k‐core polytope
- Continuum approximation techniques for the design of integrated package distribution systems
- Computing assortative mixing by degree with the \(s\)-metric in networks using linear programming
- A survey of dual-feasible and superadditive functions
- Preprocessing for a map sectorization problem by means of mathematical programming
- Complementary column generation and bounding approaches for set partitioning formulations
- On column generation formulations for the RWA problem
- Lower and upper bounds for the spanning tree with minimum branch vertices
- An optimization approach for planning daily drayage operations
- Multiple UAV coalitions for a search and prosecute mission
- On a decision procedure for quantified linear programs
- On the balanced minimum evolution polytope
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound
- Valid inequalities for the synchronization bus timetabling problem
- New formulations for the elementary shortest-path problem visiting a given set of nodes
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- On generating maximal nondominated Benders cuts
- Two-stage stochastic lot-sizing problem under cost uncertainty
- Graph coloring inequalities from all-different systems
- A hierarchical method for discrete structural topology design problems with local stress and displacement constraints
- Convex hull characterizations of lexicographic orderings
- Surrogate-RLT cuts for zero-one integer programs
- A trilevel programming approach for electric grid defense planning
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure
- A Polyhedral Characterization of Border Bases
- Cutting to the chase. Solving linear integer arithmetic
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs
- Projection, lifting and extended formulation integer and combinatorial optimization
- Resolvability of Hamming graphs
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- On the exact separation of mixed integer knapsack cuts
- A goal programming approach to vehicle routing problems with soft time windows
- A pre-assignment heuristic algorithm for the master surgical schedule problem (MSSP)
- On the chance-constrained minimum spanning \(k\)-core problem
- Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities
- A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times
- Higher-level RLT or disjunctive cuts based on a partial enumeration strategy for 0-1 mixed-integer programs
- Optimization of order policies in supply networks
- Fitting piecewise linear continuous functions
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Airline crew scheduling: state-of-the-art
- A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization
- Combinatorial optimization. Theory and algorithms.
- A polyhedral study of dynamic monopolies
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Cutting to the chase.
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
- Liner shipping service scheduling and cargo allocation
- Cyclic and non-cyclic crew rostering problems in public bus transit
- Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures
- A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints
- A Newton method for solving continuous multiple material minimum compliance problems
- Global optima for the Zhou-Rozvany problem
- Probability chains: a general linearization technique for modeling reliability in facility location and related problems
- The biobjective travelling purchaser problem
- A tutorial on the balanced minimum evolution problem
- Integer programming approach to static monopolies in graphs
- Retrieving a contingency table from a correspondence analysis solution
- A technique for speeding up the solution of the Lagrangean dual
- Combinatorial optimization. Theory and algorithms.
- New insights on integer-programming models for the kidney exchange problem
- Assessing the effectiveness of \(k\)-shortest path sets in problems of network interdiction
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
- Spatio-temporal pricing for ridesharing platforms
- On a biobjective search problem in a line: formulations and algorithms
- On a posterior evaluation of a simple greedy method for set packing
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation
- Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
- EXPLOITING OPTIMAL CONTROL FOR TARGET-ORIENTED MANIPULATION OF (BIO)CHEMICAL SYSTEMS: A MODEL-BASED APPROACH TO SPECIFIC MODIFICATION OF SELF-ORGANIZED DYNAMICS
- Revealed preference tests for weak separability: an integer programming approach
- Expressive markets for donating to charities
- Information-theoretic approaches to branching in search
- Order selection in nonlinear time series models with application to the study of cell memory
- Integer set reduction for stochastic mixed-integer programming
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions
- The value function of an infinite-horizon single-item lot-sizing problem
- Monoidal cut strengthening revisited
- A hybrid branch-and-bound and evolutionary approach for allocating strings of applications to heterogeneous distributed computing systems
- Stochastic robustness metric and its use for static resource allocations
- On approximating optimal weight ``no-certificates in weighted difference constraint systems
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 Q4943600)
