Q2861520 (Q2861520): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 01:15, 7 July 2024

scientific article

Language	Label	Description	Also known as
English	No label defined	scientific article

Statements

scholarly article

0 references

zbMATH Open document ID

0 references

0 references

0 references

publication date

8 November 2013

0 references

full work available at URL

http://www.sciencedirect.com/science/article/pii/S1571065310001265

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

Discretized formulations for capacitated location problems with modular distribution costs

0 references

A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

0 references

Lower and upper bounds for the degree-constrained minimum spanning tree problem

0 references

0-1 reformulations of the multicommodity capacitated network design problem

0 references

A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem

0 references

On the capacitated concentrator location problem: a reformulation by discretization

0 references

Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks

0 references

0 references

Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2861520

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2861520&oldid=35359182"