Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (Q2465657): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s10107-006-0043-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990399046 / 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: The volume algorithm: Producing primal solutions with a subgradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and heuristics for a minimum arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding minimum spanning trees in undirected and directed graphs / 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: A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistars and directed flow formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated minimum spanning tree problem: On improved multistar constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated minimal spanning tree problem: An experiment with a hop-indexed model / 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: On the capacitated concentrator location problem: a reformulation by discretization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the centralized network design problem on directed graphs / 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: A Polyhedral Intersection Theorem for Capacitated Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multimodal Express Package Delivery: A Service Network Design Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Path Cuts for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated arc routing problems using a transformation to the CVRP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-cut algorithm for the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3439711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem / 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: An exact algorithm for the capacitated shortest spanning arborescence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot-Sizing with Start-Up Times / rank
 
Normal rank

Latest revision as of 13:45, 27 June 2024

scientific article
Language Label Description Also known as
English
Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
scientific article

    Statements

    Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    7 January 2008
    0 references
    q-arbs
    0 references
    pricing subproblem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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