Integrating link-based discrete credit charging scheme into discrete network design problem (Q1991119): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Guang-Min Wang / rank
 
Normal rank
Property / author
 
Property / author: Zi-You Gao / 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.ejor.2018.05.069 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2807398977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An overview of bilevel optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of urban transportation network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for bi-level discrete network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic discrete network design problem for maintenance planning in traffic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative approach for solving the environmentally-oriented discrete network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of selecting and scheduling urban road construction projects as a time-dependent discrete network design problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric integer programming algorithm for bilevel mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single-level reformulation of mixed integer bilevel programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Value-Function-Based Exact Approach for the Bilevel Mixed-Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global solution of nonlinear mixed-integer bilevel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for and empirical study of algorithms for traffic assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution method for mixed integer bi-level linear problems based on decomposition technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibrium Decomposed Optimization: A Heuristic for the Continuous Equilibrium Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints / rank
 
Normal rank

Latest revision as of 03:56, 17 July 2024

scientific article
Language Label Description Also known as
English
Integrating link-based discrete credit charging scheme into discrete network design problem
scientific article

    Statements

    Integrating link-based discrete credit charging scheme into discrete network design problem (English)
    0 references
    0 references
    0 references
    0 references
    30 October 2018
    0 references
    transportation
    0 references
    discrete network design problem (DNDP)
    0 references
    bilevel programming problem
    0 references
    tradable credit scheme (TCS)
    0 references
    0 references
    0 references

    Identifiers

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