Looking for edge-equitable spanning trees (Q336753): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2013.07.023 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650559 / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning tree
Property / zbMATH Keywords: spanning tree / rank
 
Normal rank
Property / zbMATH Keywords
 
ordered median function
Property / zbMATH Keywords: ordered median function / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2013.07.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033011096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean bounds for the optimum communication spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds from a path based formulation for the tree of hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flexible model and efficient solution strategies for discrete location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equity measurement in facility location analysis: A review and framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generalized minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulations for the k-Cardinality Tree Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2013.07.023 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:47, 9 December 2024

scientific article
Language Label Description Also known as
English
Looking for edge-equitable spanning trees
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references