Enhancing discretized formulations: the knapsack reformulation and the star reformulation
type: Item
instance of: scholarly article
title: Enhancing discretized formulations: the knapsack reformulation and the star reformulation
zbMATH Open document ID: 1261.68006
author: Pedro Moura
author: Luis Gouveia
published in: Top
publication date: 2013-02-20T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6137469
zbMATH Keywords: spanning tree
zbMATH Keywords: degree constraints
zbMATH Keywords: knapsack
zbMATH Keywords: valid inequalities
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: s11750-011-0212-x
OpenAlex ID: W2044875762
cites work: Multicommodity network design with discrete node costs
cites work: Reformulation by discretization: application to economic lot sizing
cites work: Solving the variable size bin packing problem with discretized formulations
cites work: Discretized formulations for capacitated location problems with modular distribution costs
cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
cites work: Lower and upper bounds for the degree-constrained minimum spanning tree problem
cites work: A note on hop-constrained walk polytopes.
cites work: On the directed hop-constrained shortest path problem
cites work: 0-1 reformulations of the multicommodity capacitated network design problem
cites work: Q4198056
cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem
cites work: Spanning trees with node degree cependent costs and knapsack reformulations
cites work: Prize collecting Steiner trees with node degree dependent costs
cites work: On the capacitated concentrator location problem: a reformulation by discretization
cites work: A classification of formulations for the (time-dependent) traveling salesman problem
cites work: A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
cites work: Q4821303
cites work: Extended and discretized formulations for the maximum clique problem
cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
cites work: Q4254875
DOI: 10.1007/S11750-011-0212-X
description: scientific article; zbMATH DE number 6137469