Solving a selective dial-a-ride problem with logic-based Benders decomposition (Q1652651): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q130065938, #quickstatements; #temporary_batch_1726345393210
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Martin Georg Riedler / rank
Normal rank
 
Property / author
 
Property / author: Günther R. Raidl / rank
Normal rank
 
Property / author
 
Property / author: Martin Georg Riedler / rank
 
Normal rank
Property / author
 
Property / author: Günther R. Raidl / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Gecode / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / 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.cor.2018.03.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2793040688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Team Orienteering Pick-Up and Delivery Problem with Time Windows and its applications in fleet sizing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / 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: Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-vehicle profitable pickup and delivery problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155835 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling by Logic-Based Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting an exact logic-based Benders decomposition approach by variable neighborhood search / 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: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4475618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3455613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective and fast heuristic for the dial-a-ride problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q130065938 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:23, 14 September 2024

scientific article
Language Label Description Also known as
English
Solving a selective dial-a-ride problem with logic-based Benders decomposition
scientific article

    Statements

    Solving a selective dial-a-ride problem with logic-based Benders decomposition (English)
    0 references
    11 July 2018
    0 references
    transportation
    0 references
    dial-a-ride problem
    0 references
    logic-based Benders decomposition
    0 references
    combinatorial Benders cuts
    0 references
    branch-and-check
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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