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)
- 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
- Optimal length resolution refutations of difference constraint systems
- Multicriteria energy policy investments and energy market clearance via integer programming
- Frequency assignment in mobile radio systems using branch-and-cut techniques
- Second-order cover inequalities
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities
- Separation, dimension, and facet algorithms for node flow polyhedra
- Stochastic dual dynamic integer programming
- A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables
- On throughput maximization problem for UWB-based sensor networks via reformulation-linearization technique
- The Directed Minimum Latency Problem
- An evolutionary algorithm based hyper-heuristic framework for the set packing problem
- A combinatorial algorithm for Horn programs
- Estimation of the number of iterations in integer programming algorithms using the regular partitions method
- Mathematical model for efficient water flow management
- A Catalog of Formulations for the Network Pricing Problem
- Structural properties of affine sparsity constraints
- Greedy approximations for minimum submodular cover with submodular cost
- A logic-based Benders decomposition for microscopic railway timetable planning
- Computational approaches for zero forcing and related problems
- Application of a hybrid genetic algorithm to airline crew scheduling
- Improved algorithms for optimal length resolution refutation in difference constraint systems
- Parsimonious binary-encoding in integer programming
- The directed orienteering problem
- Towards global bilevel dynamic optimization
- Strong valid inequalities for fluence map optimization problem under dose-volume restrictions
- A well-defined composite indicator: an application to corporate social responsibility
- Generation of networks with prescribed degree-dependent clustering
- A novel probabilistic formulation for locating and sizing emergency medical service stations
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
- The \(p\)-arborescence star problem: formulations and exact solution approaches
- A DC Programming Approach for Mixed-Integer Linear Programs
- On dynamically generating relevant elementary flux modes in a metabolic network using optimization
- A military maintenance planning and scheduling problem
- Exact augmented Lagrangian duality for mixed integer linear programming
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Balancing of agricultural census data by using discrete optimization
- Optimal crop planting schedules and financial hedging strategies under ENSO-based climate forecasts
- Solving the minimum label spanning tree problem by mathematical programming techniques
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- Computing lower bounds on basket option prices by discretizing semi-infinite linear programming
- Logical processing for integer programming
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem
- Solving a \(k\)-node minimum label spanning arborescence problem to compress fingerprint templates
- Combinatorial \(n\)-fold integer programming and applications
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- 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
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)
