The minimum weight t-composition of an integer

DOI10.1007/S10958-012-0741-3MaRDI QIDQ690540zbMATH OpenOpenAlexFDO

Authors D. M. Cardoso, Jorge Orestes Cerdeira

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

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

Recommendations

• Minimal weight and colexicographically minimal integer representations
• Some Elementary Congruences for the Number of Weighted Integer Compositions
• On minimal additive complements of integers
• Restricted weighted integer compositions and extended binomial coefficients
• A note on minimal additive complements of integers
• The minimal excludant in integer partitions
• On the mean value of the index of composition of an integer
• On the mean value of the index of composition of an integer
• The combinatorics of weighted vector compositions
• A poset on minimal compositions of a positive integer

Cites work

• scientific article; zbMATH DE number 4141774 (Why is no real title available?)
• A Best Possible Heuristic for the k-Center Problem
• A decomposition approach for a very large scale optimal diversity management problem
• A heuristic for the p-center problem in graphs
• A note on two problems in connexion with graphs
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Solving huge size instances of the optimal diversity management problem
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
• The Optimal Diversity Management Problem

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690540)