Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709): 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 / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / 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: A note on the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem. Latest advances and new challenges. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The balanced billing cycle vehicle routing 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: Multi-objective vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming formulations of multiple salesman problems and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem: An overview of exact and approximate algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Benders' Partitioning Algorithm for Mixed Integer Programming / 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: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical enhancements to the Magnanti-Wong method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965038839 / rank
 
Normal rank

Latest revision as of 05:52, 5 July 2024

scientific article
Language Label Description Also known as
English
Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing
scientific article

    Statements

    Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (English)
    0 references
    0 references
    14 May 2012
    0 references
    fixed destination
    0 references
    multiple traveling salesman problem
    0 references
    Benders decomposition
    0 references
    multicommodity network design
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers