scientific article; zbMATH DE number 1349588

Publication date: 10 October 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (48)

Projection, consistency, and George Boole ⋮ On polynomial kernels for sparse integer linear programs ⋮ Routing of uncertain traffic demands ⋮ Identifying Codes in Hereditary Classes of Graphs and VC-Dimension ⋮ Modeling and solving the rooted distance-constrained minimum spanning tree problem ⋮ Using aggregation to optimize long-term production planning at an underground mine ⋮ Benders decomposition for curriculum-based course timetabling ⋮ Calculating the best dual bound for problems with multiple Lagrangian relaxations ⋮ Composite-variable modeling for service parts logistics ⋮ An exact algorithm for parallel machine scheduling with conflicts ⋮ Finding checkerboard patterns via fractional 0-1 programming ⋮ Scheduling web advertisements: a note on the minspace problem ⋮ 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 ⋮ Lagrangian heuristic for a class of the generalized assignment problems ⋮ Unnamed Item ⋮ The combinatorial bandwidth packing problem ⋮ A strong integer linear optimization model to the compartmentalized knapsack problem ⋮ A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs ⋮ Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications ⋮ Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ A method for solving the general parametric linear complementarity problem ⋮ A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem ⋮ Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function ⋮ Timetable construction: the algorithms and complexity perspective ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ An integer linear programming formulation for the minimum cardinality segmentation problem ⋮ Reformulation by discretization: application to economic lot sizing ⋮ Improved Lagrangian bounds and heuristics for the generalized assignment problem ⋮ Combined route capacity and route length models for unit demand vehicle routing problems ⋮ Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling ⋮ A study on the optimal inventory allocation for clinical trial supply chains ⋮ 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 ⋮ A nested benders decomposition approach for telecommunication network planning ⋮ Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion ⋮ A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision ⋮ Train timetabling for an urban rail transit line using a Lagrangian relaxation approach ⋮ A new formulation and an exact approach for the many-to-many hub location-routing problem ⋮ Polyhedral approximation in mixed-integer convex optimization ⋮ Integral analysis method - IAM ⋮ A novel modeling approach for express package carrier planning ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ Parallel subgradient algorithm with block dual decomposition for large-scale optimization ⋮ The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification ⋮ Rational elimination algorithm and applications

This page was built for publication: