Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (Q733522): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2009.03.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044793578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / 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: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge exchanges in the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut method for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lagrangian dual information to generate degree constrained spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of algorithms for the degree constrained minimum spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analytical comparison of different formulations of the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / 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: Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean approach to the degree-constrained minimum spanning tree problem / rank
 
Normal rank

Latest revision as of 02:10, 2 July 2024

scientific article
Language Label Description Also known as
English
Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
scientific article

    Statements

    Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints (English)
    0 references
    0 references
    0 references
    16 October 2009
    0 references
    mixed integer programming
    0 references
    degree-enforcing constraints
    0 references
    Miller-Tucker-Zemlin constraints
    0 references
    minimum spanning tree
    0 references
    flow formulation
    0 references
    rooted arborescence
    0 references

    Identifiers