Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (Q2289919): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126812722, #quickstatements; #temporary_batch_1723938276269
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VRP / 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.2019.104852 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2985846866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the asymmetric traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAXIMUM WEIGHT CYCLE PACKING IN DIRECTED GRAPHS, WITH APPLICATION TO KIDNEY EXCHANGE PROGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New insights on integer-programming models for the kidney exchange problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach to the Vehicle Scheduling 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: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding All the Elementary Circuits of a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the cardinality constrained multi-cycle and multi-chain problem on directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Branch-Cut-and-Price for Capacitated Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126812722 / rank
 
Normal rank

Latest revision as of 00:58, 18 August 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange
scientific article

    Statements

    Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange (English)
    0 references
    0 references
    0 references
    27 January 2020
    0 references
    kidney exchange
    0 references
    subtour
    0 references
    cycle
    0 references
    separation
    0 references
    pricing
    0 references
    column generation
    0 references
    facet
    0 references
    branch-and-cut-and-price
    0 references

    Identifiers