Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394): 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.dam.2007.05.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965779657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flight String Models for Aircraft Fleeting and Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric traveling salesman problem with replenishment arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal solution procedure for the multiple tour maximum collection problem using column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of large-scale, asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The aircraft rotation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / 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: Q5687193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: An additive bounding procedure for the asymmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—On Partitioning the Feasible Set in a Branch-and-Bound Algorithm for the Asymmetric Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional subgradient optimization -- theory and applications / 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: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of unsmooth functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A LIFO implicit enumeration algorithm for the asymmetric travelling salesman problem using a one-arborescence relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for the asymmetric capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Latest revision as of 10:05, 27 June 2024

scientific article
Language Label Description Also known as
English
Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
scientific article

    Statements

    Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (English)
    0 references
    0 references
    0 references
    21 September 2007
    0 references
    0 references
    combinatorial optimisation
    0 references
    travelling salesman
    0 references
    polyhedral analysis
    0 references
    Lagrangean relaxation
    0 references
    branch-and-bound method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references