The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (Q2943828): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1080/10556788.2014.907290 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113613179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic shortest paths minimizing travel times and costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic shortest path in stochastic dynamic networks: Ship routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vector maximization with two objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in networks with vector weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2723294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reoptimization algorithm for the shortest path problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved FPTAS for Restricted Shortest Path. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-dimensional labelling approaches to solve the linear fractional elementary shortest path problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for the Restricted Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing for multi-criteria network path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple efficient approximation scheme for the restricted shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multicriteria shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost time-varying network flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-objective and multi-constrained non-additive shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New polynomial time algorithms to compute a set of Pareto optimal paths for multi-objective shortest path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multicriteria Pareto-optimal path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiobjective routing of hazardous materials in stochastic networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:12, 10 July 2024

scientific article
Language Label Description Also known as
English
The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
scientific article

    Statements

    The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks (English)
    0 references
    0 references
    0 references
    4 September 2015
    0 references
    bi-criteria network flow
    0 references
    cross-entropy
    0 references
    discrete-time
    0 references
    0 references
    0 references
    0 references

    Identifiers

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