A branch-and-cut algorithm for the preemptive swapping problem (Q2913951): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1002/net.20447 / rank
Normal rank
 
Property / cites work
 
Property / cites work: The swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Swapping Problem on a Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The preemptive swapping problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch \& cut algorithm for the asymmetric traveling salesman problem with precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The precedence-constrained asymmetric traveling salesman polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the nonpreemptive swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the mixed swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / 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: An inexact algorithm for the sequential ordering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the symmetric travelling salesman problem I: Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4763403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistars, partial multistars and the capacitated vehicle routing problem / 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: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.20447 / rank
 
Normal rank

Latest revision as of 04:27, 20 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for the preemptive swapping problem
scientific article

    Statements

    A branch-and-cut algorithm for the preemptive swapping problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 September 2012
    0 references
    swapping problem
    0 references
    vehicle routing
    0 references
    branch-and-cut
    0 references
    precedence relationships
    0 references
    0 references
    0 references
    0 references

    Identifiers

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