A new method for solving capacitated location problems based on a set partitioning approach (Q5959081): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the capacitated concentrator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Fixed-Charge Assigning Users to Sources Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bionomic approach to the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Network Location Problems with Distance Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location on a tree with maximum distance constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities and facets of the capacitated plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated facility location: Separation algorithms and computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cross Decomposition Algorithm for Capacitated Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for solving large capacitated warehouse location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for the Vehicle Routing Problem with Backhauls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using simulated annealing to solve routing and location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set Partitioning Approach to the Crew Scheduling Problem / rank
 
Normal rank

Latest revision as of 23:01, 3 June 2024

scientific article; zbMATH DE number 1722199
Language Label Description Also known as
English
A new method for solving capacitated location problems based on a set partitioning approach
scientific article; zbMATH DE number 1722199

    Statements

    A new method for solving capacitated location problems based on a set partitioning approach (English)
    0 references
    0 references
    0 references
    0 references
    24 July 2002
    0 references

    Identifiers