Pages that link to "Item:Q5643805"
From MaRDI portal
The following pages link to A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem (Q5643805):
Displaying 50 items.
- The shortest path problem with forbidden paths (Q146692) (← links)
- Fast computation of bounds for two-terminal network reliability (Q296891) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Multiple-path selection for new highway alignments using discrete algorithms (Q320693) (← links)
- On discrete optimization with ordering (Q367635) (← links)
- An efficient time and space \(K\) point-to-point shortest simple paths algorithm (Q449479) (← links)
- Assessing the reliability and the expected performance of a network under disaster risk (Q647517) (← links)
- An algorithm for ranking paths that may contain cycles (Q759658) (← links)
- \(k\)-shortest routing of trains on shunting yards (Q841591) (← links)
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs (Q896272) (← links)
- On the \(K\)th best base of a matroid (Q935236) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems (Q976116) (← links)
- Traffic assignment model with fuzzy level of travel demand: An efficient algorithm based on quasi-logit formulas (Q1002057) (← links)
- The school bus routing problem: a review (Q1039772) (← links)
- On the \(K\) shortest path trees problem (Q1040982) (← links)
- Flows with unit path capacities and related packing and covering problems (Q1041430) (← links)
- Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions (Q1062913) (← links)
- Algorithms for finding k-best perfect matchings (Q1090343) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- A bicriterion shortest path algorithm (Q1166423) (← links)
- On the spanning trees of weighted graphs (Q1204524) (← links)
- Evaluating the demand for supergauge trucks-on-trains sevices in Western Europe (Q1278623) (← links)
- Two-best solutions under distance constraints: The model and exemplary results for matroids (Q1291060) (← links)
- Generating the best \(K\) sequences in relocation problems (Q1309945) (← links)
- On variations of the subset sum problem (Q1382248) (← links)
- Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
- Computing and listing \(st\)-paths in public transportation networks (Q1635813) (← links)
- Randomised enumeration of small witnesses using a decision oracle (Q1725640) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- Finding a given number of solutions to a system of fuzzy constraints (Q1745696) (← links)
- Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Finding the \(K\) shortest hyperpaths (Q1764762) (← links)
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment (Q1823142) (← links)
- An O(K.n**4) algorithm for finding the K best cuts in a network (Q1836587) (← links)
- A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs (Q1864209) (← links)
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
- A note on \(K\) best network flows (Q1897375) (← links)
- Combinatorial algorithms for DNA sequence assembly (Q1902464) (← links)
- Enumerating \(K\) best paths in length order in DAGs (Q1926859) (← links)
- Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs (Q1949751) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- A theoretical and computational equilibria analysis of a multi-player kidney exchange program (Q2083966) (← links)
- Structural tractability of enumerating CSP solutions (Q2342585) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- Memetic algorithms (Q2573010) (← links)
- On the bicriterion - minimal cost/minimal label - spanning tree problem (Q2655606) (← links)
