Pages that link to "Item:Q3762099"
From MaRDI portal
The following pages link to Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems (Q3762099):
Displaying 50 items.
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem (Q255267) (← links)
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- New approaches to multi-objective optimization (Q403670) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Maximum probability shortest path problem (Q491594) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Multiple criteria dynamic programming and multiple knapsack problem (Q529961) (← links)
- Routing with nonlinear multiattribute cost functions (Q686201) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- On finding dissimilar Pareto-optimal paths (Q707132) (← links)
- A parametric approach to solving bicriterion shortest path problems (Q810382) (← links)
- Multiobjective optimization: Improved FPTAS for shortest paths and nonlinear objectives with applications (Q841630) (← links)
- Efficient offline algorithms for the bicriteria \(k\)-server problem and online applications (Q849632) (← links)
- Discrete dynamic programming with outcomes in random variable structures (Q857283) (← links)
- An interactive approach to identify the best compromise solution for two objective shortest path problems (Q912767) (← links)
- Optimal paths in bi-attribute networks with fractional cost functions (Q928022) (← links)
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time (Q989525) (← links)
- Min-max and min-max regret versions of combinatorial optimization problems: A survey (Q1014933) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
- Bicriteria network flow problems: Integer case (Q1207067) (← links)
- Modifying edges of a network to obtain short subgraphs (Q1274323) (← links)
- Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function (Q1280137) (← links)
- Approximating the weight of shallow Steiner trees (Q1296580) (← links)
- An interactive procedure using domination cones for bicriterion shortest path problems (Q1317170) (← links)
- The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602) (← links)
- The interactive analysis of the multicriteria shortest path problem by the reference point method. (Q1406958) (← links)
- Norm-based approximation in multicriteria programming. (Q1416300) (← links)
- A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. (Q1426727) (← links)
- Fuzzy shortest path problems incorporating interactivity among paths. (Q1426738) (← links)
- Stack-up algorithms for palletizing at delivery industry (Q1592737) (← links)
- Approximation algorithms for multi-parameter graph optimization problems (Q1602708) (← links)
- Optimal pricing and composition of multiple bundles: a two-step approach (Q1751886) (← links)
- Reference points and approximation algorithms in multicriteria discrete optimization (Q1753504) (← links)
- The quickest path problem with interval lead times (Q1765546) (← links)
- Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
- An empirical investigation of some bicriterion shortest path algorithms (Q1823874) (← links)
- An improved FPTAS for Restricted Shortest Path. (Q1853085) (← links)
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
- Multiobjective routing problems (Q1919112) (← links)
- Approximation algorithms for constructing some required structures in digraphs (Q2255946) (← links)
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems (Q2256205) (← links)
- A two-criterion lexicographic algorithm for finding all shortest paths in networks (Q2263347) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- Maximum probabilistic all-or-nothing paths (Q2286936) (← links)
- Improved approximation algorithms for the combination problem of parallel machine scheduling and path (Q2331579) (← links)
- Approximate tradeoffs on weighted labeled matroids (Q2341761) (← links)
- A combination of flow shop scheduling and the shortest path problem (Q2354293) (← links)
