Bike sharing systems: solving the static rebalancing problem (Q2445841): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q188435
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2012.11.005 / rank
Normal rank
 
Property / author
 
Property / author: Roberto Wolfler Calvo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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.1016/j.disopt.2012.11.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054274567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bike sharing systems: solving the static rebalancing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balancing the stations of a self service “bike hire” system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / 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 swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the preemptive swapping problem / 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: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem / 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: Separating capacity constraints in the CVRP using tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tabu Search Heuristic for the Vehicle Routing Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2012.11.005 / rank
 
Normal rank

Latest revision as of 16:37, 18 December 2024

scientific article
Language Label Description Also known as
English
Bike sharing systems: solving the static rebalancing problem
scientific article

    Statements

    Bike sharing systems: solving the static rebalancing problem (English)
    0 references
    0 references
    0 references
    0 references
    15 April 2014
    0 references
    branch-and-cut
    0 references
    complexity
    0 references
    local search
    0 references
    relaxation
    0 references
    routing
    0 references

    Identifiers

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