Location, scheduling, design and integer programming
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Combinatorics in computer science (68R05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)
Location, scheduling and design problems are assignment type problems with quadratic cost functions. The area of their applications is stretching from spatial economics via plant and office layout planning to VLSI design problems in high-technology production settings. The presence of nonlinear interaction terms in the objective function makes these, otherwise simple, problems NP hard. The monograph provides first a survey of models of this type and gives a common framework for them as Boolean quadratic problems with special ordered sets (BQPSs). This survey is followed by a review of traditional solution approaches to BQPSs. In the main part of the book, the authors follow the polyhedral approach to combinatorial problem solving because of acknowledged algorithmic advantages of this approach. The book includes Fortran programs for small symmetric quadratic assignment problems.
- Solving scheduling and location problems in the plane simultaneously
- Integrated scheduling and location models: single machine makespan problems
- Facility siting and integer-friendly programming
- Exact algorithms for integrated facility location and production planning problems
- Scheduling-location algorithms with applications in evacuation planning
- Simultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problem
- Heuristic Methods for Location-Allocation Problems
- The discrete lot-sizing and scheduling problem
- Local Search in Complex Scheduling Problems
- Counting the solutions of Presburger equations without enumerating them.
- Approximating separable nonlinear functions via mixed zero-one programs
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic 0-1 optimization problems with linear constraints
- Models and solution techniques for production planning problems with increasing byproducts
- Locally ideal formulations for piecewise linear functions with indicator variables
- Incremental and encoding formulations for mixed integer programming
- Compact linearization for binary quadratic problems
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- Mixed integer linear programming formulation techniques
- Some integer programs arising in the design of main frame computers
- Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes
- Classical cuts for mixed-integer programming and branch-and-cut
- Best reduction of the quadratic semi-assignment problem
- The QAP-polytope and the star transformation
- Selected topics on assignment problems
- GRASP with path-relinking for the generalized quadratic assignment problem
- A survey for the quadratic assignment problem
- The service allocation problem at the Gioia Tauro maritime terminal
- Effective formulation reductions for the quadratic assignment problem
This page was built for publication: Location, scheduling, design and integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352556)
