scientific article; zbMATH DE number 1312984
From MaRDI portal
Publication:4254875
zbMATH Open0930.90072MaRDI QIDQ4254875FDOQ4254875
Authors: Laurence A. Wolsey 
Publication date: 1 July 1999
Title of this publication is not available (Why is that?)
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Mixed integer programming (90C11) 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 virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem
- The rank pricing problem: models and branch-and-cut algorithms
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- Facets for single module and multi-module capacitated lot-sizing problems without backlogging
- A note on maximal covering location games
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints
- Tight second stage formulations in two-stage stochastic mixed integer programs
- Robust decision making using a general utility set
- Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms
- A first look at picking dual variables for maximizing reduced cost fixing
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems
- Towards effective exact methods for the maximum balanced biclique problem in bipartite graphs
- Extended formulation for hop constrained distribution network configuration problems
- Integer programming as projection
- On the complexity of the separation problem for rounded capacity inequalities
- The separation problem of rounded capacity inequalities: some polynomial cases
- Integer programming for urban design
- Decomposition methods for the two-stage stochastic Steiner tree problem
- A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem
- Computing the \(\mathcal{P}_3\)-hull number of a graph, a polyhedral approach
- Modeling formulation and a new heuristic for the railroad blocking problem
- Optimal pathway reconstruction on 3D NMR maps
- Capacity expansion of stochastic power generation under two-stage electricity markets
- Minimizing average project team size given multi-skilled workers with heterogeneous skill levels
- The green capacitated multi-item lot sizing problem with parallel machines
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems
- Scheduling pumpoff operations in onshore oilfields with electric-power constraints and variable cycle time
- Redundancy system design for an aircraft door management system
- Solution methods for the tray optimization problem
- A survey of the standard location-routing problem
- Bi-objective scheduling on a restricted batching machine
- The Integrality Number of an Integer Program
- A bi-integrated model for coupling lot-sizing and cutting-stock problems
- A data-driven distributionally robust bound on the expected optimal value of uncertain mixed 0-1 linear programming
- Maximum margin semi-supervised learning with irrelevant data
- Integer Programming Subject to Monomial Constraints
- Decomposition Branching for Mixed Integer Programming
- Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers
- Another pedagogy for mixed-integer Gomory
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems
- Adaptive two-stage optimal designs for phase II clinical studies that allow early futility stopping
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- A frontier-based system of incentives for units in organisations with varying degrees of decentralisation
- Mixed-integer programming models for optimal constellation scheduling given cloud cover uncertainty
- Sharp bounds for the second-order general connectivity index of hexagonal chains
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
- A multi-period network design problem for cellular telecommunication systems
- Branch-and-refine for solving time-expanded MILP formulations
- Strategic planning of an underground mine with variable cut-off grades
- Exact solution of the soft-clustered vehicle-routing problem
- The invisible‐hand heuristic for origin‐destination integer multicommodity network flows
- Algorithmic expedients for the \(S\)-labeling problem
- A hybrid differential evolution algorithm with column generation for resource constrained job scheduling
- A subsidy policy to managing hazmat risk in railroad transportation network
- Dissecting the duality gap: the supporting hyperplane interpretation revisited
- Particle filter-based data assimilation technique for the evaluation of transport of pollutants in small rivers
- Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- Random sampling and machine learning to understand good decompositions
- Polyhedral results and branch-and-cut for the resource loading problem
- Policy-based branch-and-bound for infinite-horizon multi-model Markov decision processes
- Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure
- Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties
- An iterative heuristic for passenger-centric train timetabling with integrated adaption times
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
- An integer programming approach for solving a generalized version of the Grundy domination number
- The time buffer approximated buffer allocation problem: a row-column generation approach
- Simple majority rule and integer programming
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- Linear integer programming. Theory, applications, recent developments
- Integer linear programming models for grid-based light post location problem
- A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints
- Efficient formulations for the traveling car renter problem and its quota variant
- Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm
- A cut-and-branch algorithm for the quadratic knapsack problem
- Learning monotone preferences using a majority rule sorting model
- Column generation approach to line planning with various halting patterns - application to the Korean high-speed railway
- Shattering inequalities for learning optimal decision trees
- Branch-and-price for a class of nonconvex mixed-integer nonlinear programs
- An exact algorithm for the budget-constrained multiple knapsack problem
- A survey on mixed-integer programming techniques in bilevel optimization
- Formulations and theoretical analysis of the one-dimensional multi-period cutting stock problem with setup cost
- Feeder routing for air-to-air refueling operations
- A theoretical justification of the set covering greedy heuristic of Caprara et al.
- A transformation-proximal bundle algorithm for multistage adaptive robust optimization and application to constrained robust optimal control
- The dual polyhedron to the chordal graph polytope and the rebuttal of the chordal graph conjecture
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- Optimal collection of medical specimens and delivery to central laboratory
- Mixed-integer optimization methods for online scheduling in large-scale HVAC systems
- Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem
- Distributionally robust optimization. A review on theory and applications
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 Q4254875)
