Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (Q2892153): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Alexandre Xavier Martins / rank
Normal rank
 
Property / author
 
Property / author: Alexandre Xavier Martins / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GRASP / 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.1002/net.20485 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094626628 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of exact knapsack separation for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Fenchel Cutting Planes for Knapsack Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel Cutting Planes for Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a generalization of the master cyclic group polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact separation of mixed integer knapsack cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multilevel Capacitated Minimum Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced second order algorithm applied to the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated facility location problems by Fenchel cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong bounds with cut and column generation for class-teacher timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:18, 5 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem
scientific article

    Statements

    Branch-and-cut and hybrid local search for the multi-level capacitated minimum spanning tree problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    18 June 2012
    0 references
    network design
    0 references
    branch-and-cut
    0 references
    Fenchel cuts
    0 references
    MIP based local search
    0 references
    0 references

    Identifiers