Location, scheduling, design and integer programming

zbMath0879.68075MaRDI QIDQ1352556

Minendra P. Rijal, Manfred W. Padberg

Publication date: 16 February 1997

Published in: International Series in Operations Research \& Management Science (Search for Journal in Brave)

zbMATH Keywords

schedulingVLSI designlocationlayout planningquadratic assignment problemsdesign problems

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Integer programming (90C10) Combinatorics in computer science (68R05) Deterministic scheduling theory in operations research (90B35) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (22)

Sequence of polyhedral relaxations for nonlinear univariate functions ⋮ A survey for the quadratic assignment problem ⋮ The service allocation problem at the Gioia Tauro maritime terminal ⋮ Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods ⋮ Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints ⋮ Counting the solutions of Presburger equations without enumerating them. ⋮ Locally ideal formulations for piecewise linear functions with indicator variables ⋮ Incremental and encoding formulations for mixed integer programming ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations ⋮ Models and solution techniques for production planning problems with increasing byproducts ⋮ Compact linearization for binary quadratic problems ⋮ Best reduction of the quadratic semi-assignment problem ⋮ Selected topics on assignment problems ⋮ A new class of preconditioners for large-scale linear systems from interior point methods for linear programming ⋮ The QAP-polytope and the star transformation ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ A performance guarantee heuristic for electronic components placement problems including thermal effects ⋮ Mixed Integer Linear Programming Formulation Techniques ⋮ Solving mixed-integer nonlinear programmes using adaptively refined mixed-integer linear programmes ⋮ GRASP with path-relinking for the generalized quadratic assignment problem ⋮ Approximating separable nonlinear functions via mixed zero-one programs

Uses Software

• QAPLIB

This page was built for publication: Location, scheduling, design and integer programming