Enhancing discretized formulations: the knapsack reformulation and the star reformulation
From MaRDI portal
Publication:1935879
DOI10.1007/s11750-011-0212-xzbMath1261.68006OpenAlexW2044875762MaRDI QIDQ1935879
Publication date: 20 February 2013
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-011-0212-x
Integer programming (90C10) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items (5)
An integer linear formulation for the file transfer scheduling problem ⋮ Single PON network design with unconstrained splitting stages ⋮ Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations ⋮ Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations ⋮ Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on hop-constrained walk polytopes.
- Prize collecting Steiner trees with node degree dependent costs
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- 0-1 reformulations of the multicommodity capacitated network design problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- On the directed hop-constrained shortest path problem
- Solving the variable size bin packing problem with discretized formulations
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Reformulation by discretization: application to economic lot sizing
- On the capacitated concentrator location problem: a reformulation by discretization
- Discretized formulations for capacitated location problems with modular distribution costs
- Extended and discretized formulations for the maximum clique problem
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Multicommodity network design with discrete node costs
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
This page was built for publication: Enhancing discretized formulations: the knapsack reformulation and the star reformulation
