A location-routing problem in glass recycling (Q2259043): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / 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.1007/s10479-014-1621-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2038755873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chained Lin-Kernighan for Large Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level network for recycling sand: A case study / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing-allocation problem: A unifying framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The design of reverse distribution networks: Models and solution procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximal covering location model in the presence of partial coverage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating median cycles in networks / 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: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the<i>p</i>-Center problem with Tabu Search and Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood tabu search and its application to the median cycle problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-routing: issues, models and methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229605 / rank
 
Normal rank

Latest revision as of 18:56, 9 July 2024

scientific article
Language Label Description Also known as
English
A location-routing problem in glass recycling
scientific article

    Statements

    A location-routing problem in glass recycling (English)
    0 references
    0 references
    0 references
    27 February 2015
    0 references
    location-routing
    0 references
    maximal covering problem
    0 references
    traveling salesman problem
    0 references
    vehicle routing allocation problem
    0 references
    glass recycling
    0 references
    geographical information systems
    0 references
    0 references
    0 references

    Identifiers