An optimization model and a solution algorithm for the many-to-many car pooling problem (Q763101): 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.1007/s10479-011-0948-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2070937143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Optimizing Dynamic Dial-a-Ride Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The optimality of the online greedy algorithm in carpool and chairman assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dial-a-ride problem: Models and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Dial-a-Ride problem using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dial-a-ride problem for client transportation in a health-care organization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fairness in the carpool problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective and fast heuristic for the dial-a-ride problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distributed geographic information system for the daily car pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating reduced costs under degeneracy in a network flow problem with side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling of emergency roadway repair and subsequent relief distribution / rank
 
Normal rank

Latest revision as of 00:13, 5 July 2024

scientific article
Language Label Description Also known as
English
An optimization model and a solution algorithm for the many-to-many car pooling problem
scientific article

    Statements

    An optimization model and a solution algorithm for the many-to-many car pooling problem (English)
    0 references
    0 references
    0 references
    9 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    car pooling
    0 references
    many-to-many
    0 references
    time-space network
    0 references
    multiple commodity network flow problem
    0 references
    Lagrangian relaxation
    0 references
    0 references
    0 references
    0 references