The minimum weight \(t\)-composition of an integer

DOI10.1007/s10958-012-0741-3zbMath1254.05066OpenAlexW2079453496MaRDI QIDQ690540

Jorge Orestes Cerdeira, Domingos Moreira Cardoso

Publication date: 28 November 2012

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-012-0741-3

zbMATH Keywords

shortest pathminimum weightcost function, location problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Inventory, storage, reservoirs (90B05) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

The linking set problem: a polynomial special case of the multiple-choice knapsack problem ⋮ A decomposition approach for the \(p\)-median problem on disconnected graphs ⋮ Using decomposition to improve greedy solutions of the optimal diversity management problem

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Solving huge size instances of the optimal diversity management problem
• A heuristic for the p-center problem in graphs
• A decomposition approach for a very large scale optimal diversity management problem
• A Best Possible Heuristic for the k-Center Problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• The Optimal Diversity Management Problem
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median

This page was built for publication: The minimum weight \(t\)-composition of an integer