scientific article; zbMATH DE number 1349588
This book is a very comprehensive textbook of linear and integer optimization. It presents a unified approach to the subject and is one of few books treating linear and integer aspects together. The text is divided into six parts. The first part motivates the investigations with several applied problems, and it presents introductory material. The second part is devoted to the theory. Linear systems and integer linear systems are investigated, and projection and inverse projection are the essential tools for this approach. These tools are used for duality theory, theorems of the alternative, complementary slackness and sensitivity analysis. Part III is devoted to algorithms for linear and integer programs. The simplex method, interior point methods - like Karmarkar's algorithm and barrier methods - and branch-and-bound methods are discussed in detail. Part IV describes how to solve large scale problems by decomposition. Benders' decomposition, Dantzig-Wolfe decomposition and Lagrangian methods are the subject of this part. The investigation of large scale problems in the fifth part uses the special structure of concrete problems. Sparse methods are described, and network flow linear programs are investigated. For large integer programs the major topics are preprocessing, cutting planes, projection and inverse projection. Part VI is an appendix and gives aspects of polyhedral, complexity and graph theory, and it refers to software. The list of references contains 479 contributions - not only the classical ones but also the most recent literature. This is an interesting book with special features. The unified approach to linear and integer optimization has been already mentioned. The fundamental results are presented before the simplex method is explained. Therefore, the basics can be understood without algorithmic considerations. The text is written in a clear and readily comprehensible way, and it contains computer programs as well as many examples being helpful for students. This book is an important textbook of mathematical programming.
- Integral analysis method - IAM
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Benders decomposition for curriculum-based course timetabling
- An integer linear programming formulation for the minimum cardinality segmentation problem
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Polyhedral approximation in mixed-integer convex optimization
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- A study on the optimal inventory allocation for clinical trial supply chains
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- Calculating the best dual bound for problems with multiple Lagrangian relaxations
- An exact algorithm for parallel machine scheduling with conflicts
- A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
- A method for solving the general parametric linear complementarity problem
- Reformulation by discretization: application to economic lot sizing
- Optimization models for the single delay management problem in public transportation
- The selection and scheduling of telecommunication calls with time windows
- Decomposition and dynamic cut generation in integer linear programming
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Projection, consistency, and George Boole
- Equitable routing of rail hazardous materials shipments using CVaR methodology
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
- A tutorial on the balanced minimum evolution problem
- On polynomial kernels for sparse integer linear programs
- Identifying codes in hereditary classes of graphs and VC-dimension
- A nested Benders decomposition approach for telecommunication network planning
- A novel modeling approach for express package carrier planning
- On general decomposition schemes in mathematical programming
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- scientific article; zbMATH DE number 1737519 (Why is no real title available?)
- scientific article; zbMATH DE number 4001344 (Why is no real title available?)
- Timetable construction: the algorithms and complexity perspective
- Mixed-integer linear representability, disjunctions, and Chvátal functions -- modeling implications
- Solving stochastic and bilevel mixed-integer programs via a generalized value function
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- Linear and integer optimization. Theory and practice
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- On the topological Picard's fixed point iterative algorithm for the simplex method of optimization
- Rational elimination algorithm and applications
- Finding checkerboard patterns via fractional 0-1 programming
- A strong integer linear optimization model to the compartmentalized knapsack problem
- Lagrangian heuristic for a class of the generalized assignment problems
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- The combinatorial bandwidth packing problem
- Row-Oriented Decomposition in Large-Scale Linear Optimization
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
- Routing of uncertain traffic demands
- Using aggregation to optimize long-term production planning at an underground mine
- Composite-variable modeling for service parts logistics
- Scheduling web advertisements: a note on the minspace problem
- Combined route capacity and route length models for unit demand vehicle 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 Q4265265)
