Finding the nucleolus of the vehicle routing game with time windows (Q1988954): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apm.2019.11.026 / 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.apm.2019.11.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2990999583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nucleolus of a Characteristic Function Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nucleolus of the basic vehicle routing game / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic solution for the nucleolus of a three-player cooperative game / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nucleolus as a Solution of a Minimization Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the nucleolus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nucleolus of any \(n\)-person cooperative game by a single linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A procedure for finding the nucleolus of a cooperativen person game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex based algorithm for the lexicographically extended linear maxmin problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the nucleolus of an \(n\)-person cooperative game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Nucleolus by Solving a Prolonged Simplex Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nucleolus when the characteristic function is given implicitly: A constraint generation approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman game: An application of cost allocation in a gas and oil company / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of the leastcore and prenucleolus of cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the nucleoli of large cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate nucleolus-based revenue sharing in airline alliances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic procedure for computing the nucleolus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core and nucleolus of games: a note on a paper by Göthe-Lundgren et al. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the constrained shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The school bus routing problem: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A post-improvement procedure for the mixed load school bus routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooperative game theory approach to allocating benefits of horizontal cooperation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collaborative vehicle routing: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on cost allocation methods in collaborative transportation / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126654841 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APM.2019.11.026 / rank
 
Normal rank

Latest revision as of 16:46, 16 December 2024

scientific article
Language Label Description Also known as
English
Finding the nucleolus of the vehicle routing game with time windows
scientific article

    Statements

    Finding the nucleolus of the vehicle routing game with time windows (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2020
    0 references
    combinatorial optimization
    0 references
    cooperative game
    0 references
    vehicle routing
    0 references
    cost allocation
    0 references
    nucleolus
    0 references
    0 references

    Identifiers