The following pages link to Daniel Vanderpooten (Q319417):
Displaying 50 items.
- A multi-objective interactive system for adaptive traffic control (Q319419) (← links)
- On the representation of the search region in multi-objective optimization (Q319674) (← links)
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
- Critical edges/nodes for the minimum spanning tree problem: complexity and approximation (Q358656) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- (Q398895) (redirect page) (← links)
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size (Q398896) (← links)
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- Bi-objective matchings with the triangle inequality (Q515541) (← links)
- Preference-based English reverse auctions (Q646553) (← links)
- Complexity of the min-max and min-max regret assignment problems (Q813974) (← links)
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems (Q858438) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Complexity of the min-max (regret) versions of min cut problems (Q924631) (← links)
- Approximation of satisfactory bisection problems (Q931729) (← links)
- Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← 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)
- An overview on ``The European school of MCDA: Emergence, basic features and current works'' (Q1278801) (← links)
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) (← links)
- Construction of rule-based assignment models (Q1600909) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- Weighted sum model with partial preference information: application to multi-objective optimization (Q1753485) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- Efficient determination of the \(k\) most vital edges for the minimum spanning tree problem (Q1761238) (← links)
- Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
- Aggregation of dispersed consequences for constructing criteria: The evaluation of flood risk reduction strategies (Q1869393) (← links)
- Lexicographic \(\alpha \)-robustness: an alternative to min-max criteria (Q1926791) (← links)
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389) (← links)
- One-exact approximate Pareto sets (Q2038919) (← links)
- The power of the weighted sum scalarization for approximating multiobjective optimization problems (Q2075396) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- An FPTAS for a general class of parametric optimization problems (Q2300026) (← links)
- Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007) (← links)
- A bi-criteria approach for the data association problem (Q2379873) (← links)
- On the number of non-dominated points of a multicriteria optimization problem (Q2446874) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- The satisfactory partition problem (Q2495904) (← links)
- Induction of decision rules in classification and discovery-oriented perspectives (Q2710083) (← links)
- A bicriteria flow-shop scheduling problem with two serial batching machines (Q2861549) (← links)
- Complexity of Determining the Most Vital Elements for the 1-median and 1-center Location Problems (Q3066160) (← links)
- The lexicographic α-robust knapsack problem (Q3087844) (← links)
- Energy crop supply in France: a min-max regret approach (Q3518831) (← links)
- A Practical Efficient Fptas for the 0-1 Multi-objective Knapsack Problem (Q3527261) (← links)
- Lexicographic<i>α</i>-robustness: an application to the 1-median problem (Q3561752) (← links)
- Approximating Min-Max (Regret) Versions of Some Polynomial Problems (Q3591305) (← links)
- (Q4230928) (← links)
