scientific article; zbMATH DE number 1349588
From MaRDI portal
Publication:4265265
zbMATH Open1053.90001MaRDI QIDQ4265265FDOQ4265265
Publication date: 10 October 1999
Title of this publication is not available (Why is that?)
Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited In (50)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
- Polyhedral approximation in mixed-integer convex optimization
- Projection, consistency, and George Boole
- Title not available (Why is that?)
- On polynomial kernels for sparse integer linear programs
- A nested benders decomposition approach for telecommunication network planning
- An integer linear programming formulation for the minimum cardinality segmentation problem
- Train timetabling for an urban rail transit line using a Lagrangian relaxation approach
- Integral analysis method - IAM
- Rational elimination algorithm and applications
- Timetable construction: the algorithms and complexity perspective
- An exact algorithm for parallel machine scheduling with conflicts
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
- A study on the optimal inventory allocation for clinical trial supply chains
- Using aggregation to optimize long-term production planning at an underground mine
- Routing of uncertain traffic demands
- Finding checkerboard patterns via fractional 0-1 programming
- Reformulation by discretization: application to economic lot sizing
- Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
- Lagrangian heuristic for a class of the generalized assignment problems
- The combinatorial bandwidth packing problem
- Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming
- Equitable routing of rail hazardous materials shipments using CVaR methodology
- Dantzig-Wolfe decomposition of the daily course pattern formulation for curriculum-based course timetabling
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
- Composite-variable modeling for service parts logistics
- Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems
- Calculating the best dual bound for problems with multiple Lagrangian relaxations
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- Scheduling web advertisements: a note on the minspace problem
- On general decomposition schemes in mathematical programming
- Title not available (Why is that?)
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A novel modeling approach for express package carrier planning
- Benders decomposition for curriculum-based course timetabling
- Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function
- A strong integer linear optimization model to the compartmentalized knapsack problem
- Modeling and solving the rooted distance-constrained minimum spanning tree problem
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Combined route capacity and route length models for unit demand vehicle routing problems
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization
- Optimization models for the single delay management problem in public transportation
- A new formulation and an exact approach for the many-to-many hub location-routing problem
- Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications
- Mathematical models to reconstruct phylogenetic trees under the minimum evolution criterion
- A tutorial on the balanced minimum evolution problem
- 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
- Decomposition and dynamic cut generation in integer linear programming
- The selection and scheduling of telecommunication calls with time windows
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)
