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
- Title not available (Why is that?)
- A trust-region-based derivative free algorithm for mixed integer programming
- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Searching multiregression dynamic models of resting-state fMRI networks using integer programming
- Polynomial invariants for arbitrary rank \(D\) weakly-colored stranded graphs
- MMC techniques for limited dependent variables models: implementation by the branch-and-bound algorithm
- Parallelization of the FICO Xpress-Optimizer
- The omnipresence of Lagrange
- An algorithmic framework for convex mixed integer nonlinear programs
- A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
- Integer programming techniques for the nurse rostering problem
- LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm
- Optimization-based heuristics for underground mine scheduling
- Convex hulls of superincreasing knapsacks and lexicographic orderings
- Cyclic preference scheduling for nurses using branch and price
- Integer-programming software systems
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Detecting critical nodes in sparse graphs
- Dynamic resource allocation problem for transportation network evacuation
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain
- Shortest-path network interdiction
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
- Bus driver duty optimization using an integer programming and evolutionary hybrid algorithm
- Local convex hulls for a special class of integer multicommodity flow problems
- A fix-and-optimize heuristic for the high school timetabling problem
- On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming
- Extension of model-based classification for binary data when training and test populations differ
- A MEAN-VARIANCE-SKEWNESS MODEL: ALGORITHM AND APPLICATIONS
- Title not available (Why is that?)
- Intermediate integer programming representations using value disjunctions
- Constraint programming-based column generation
- Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets
- A parallelised distributed implementation of a branch and fix coordination algorithm
- Two-phase branch-and-cut for the mixed capacitated general routing problem
- Path inequalities for the vehicle routing problem with time windows
- Maximizing system lifetime in wireless sensor networks
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles
- Solving the hub location problem in a star–star network
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- Title not available (Why is that?)
- The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
- Solving planning and design problems in the process industry using mixed integer and global optimization
- A branch-and-cut algorithm for the capacitated profitable tour problem
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Valid inequalities for the synchronization bus timetabling problem
- On solving manufacturing cell formation via bicluster editing
- Robust optimisation of green wireless LANs under rate uncertainty and user mobility
- Using and extending fix-and-relax to solve maritime inventory routing 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 Q4254875)
