Pages that link to "Item:Q1426457"
From MaRDI portal
The following pages link to On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457):
Displaying 14 items.
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
- Bicriteria scheduling problem for unrelated parallel machines with release dates (Q342063) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- One-exact approximate Pareto sets (Q2038919) (← links)
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time (Q2098029) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
- A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling (Q3163193) (← links)
- Approximation Methods for Multiobjective Optimization Problems: A Survey (Q5084597) (← links)
- Bi-objective cell loading problem with non-zero setup times with fuzzy aspiration levels in labour intensive manufacturing cells (Q5444618) (← links)
- Approximation algorithms for coupled task scheduling minimizing the sum of completion times (Q6179222) (← links)
