Enhancing discretized formulations: the knapsack reformulation and the star reformulation
From MaRDI portal
Publication:1935879
Recommendations
- Reformulation by discretization: application to economic lot sizing
- Discretized formulations for capacitated location problems with modular distribution costs
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems
- Dantzig-Wolfe reformulations for binary quadratic problems
- On the capacitated concentrator location problem: a reformulation by discretization
Cites work
- 0-1 reformulations of the multicommodity capacitated network design problem
- A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
- A note on hop-constrained walk polytopes.
- Discretized formulations for capacitated location problems with modular distribution costs
- Extended and discretized formulations for the maximum clique problem
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Lower and upper bounds for the degree-constrained minimum spanning tree problem
- Multicommodity network design with discrete node costs
- On the capacitated concentrator location problem: a reformulation by discretization
- On the directed hop-constrained shortest path problem
- Prize collecting Steiner trees with node degree dependent costs
- Reformulation by discretization: application to economic lot sizing
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Solving the variable size bin packing problem with discretized formulations
- Spanning trees with node degree cependent costs and knapsack reformulations
Cited in
(5)- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations
- Single PON network design with unconstrained splitting stages
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
- An integer linear formulation for the file transfer scheduling problem
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
This page was built for publication: Enhancing discretized formulations: the knapsack reformulation and the star reformulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935879)
