The following pages link to Matthias Ehrgott (Q297048):
Displaying 50 items.
- On the mixing set with a knapsack constraint (Q291057) (← links)
- Minmax robustness for multi-objective optimization problems (Q297049) (← links)
- Stronger bounds and faster algorithms for packing in generalized kernel systems (Q312660) (← links)
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360) (← links)
- On finding representative non-dominated points for bi-objective integer network flow problems (Q337035) (← links)
- Integer programming methods for large-scale practical classroom assignment problems (Q337258) (← links)
- A framework for and empirical study of algorithms for traffic assignment (Q337346) (← links)
- Some properties of convex hulls of integer points contained in general convex sets (Q378131) (← links)
- MPOC: an agglomerative algorithm for multicriteria partially ordered clustering (Q385464) (← links)
- A dual variant of Benson's ``outer approximation algorithm'' for multiple objective linear programming (Q427391) (← links)
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- On well-posedness and Hausdorff convergence of solution sets of vector optimization problems (Q438791) (← links)
- Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control (Q467420) (← links)
- Isolated and proper efficiencies in semi-infinite vector optimization problems (Q467444) (← links)
- Solving multi-objective traffic assignment (Q490239) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- An exponential lower bound for Cunningham's rule (Q507321) (← links)
- On the time transformation of mixed integer optimal control problems using a consistent fixed integer control function (Q507341) (← links)
- Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\) (Q526839) (← links)
- On the effects of the degree of discretion in reporting managerial performance (Q538488) (← links)
- An approximation algorithm for convex multi-objective programming problems (Q548180) (← links)
- Compact labelings for efficient first-order model-checking (Q626458) (← links)
- A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling (Q626634) (← links)
- Deterministic global optimization. Geometric branch-and-bound methods and their applications (Q642467) (← links)
- Integrating column generation in a method to compute a discrete representation of the non-dominated set of multi-objective linear programmes (Q681288) (← links)
- Utility in case-based decision theory (Q697850) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Mixing polyhedra with two non divisible coefficients (Q715089) (← links)
- A systematic approach to bound factor-revealing LPs and its application to the metric and squared metric facility location problems (Q747779) (← links)
- Seven problems: so different yet close (Q826117) (← links)
- A hyper-relation characterization of weak pseudo-rationalizability (Q826921) (← links)
- Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks (Q833580) (← links)
- Theoretical aspects of local search. (Q859710) (← links)
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem (Q868473) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- Polyhedral properties of the \(K\)-median problem on a tree (Q879965) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- A simplex based algorithm to solve separated continuous linear programs (Q930346) (← links)
- Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning (Q953293) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- An algorithm for ordinal sorting based on ELECTRE with categories defined by examples (Q960115) (← links)
- Variable preference modeling with ideal-symmetric convex cones (Q960117) (← links)
- Relations between facets of low- and high-dimensional group problems (Q964183) (← links)
- Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions (Q968013) (← links)
- Approximating the nondominated set of an MOLP by approximately solving its dual problem (Q999127) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Improved \(\varepsilon\)-constraint method for multiobjective programming (Q1014011) (← links)
- Optimality conditions for vector optimization problems (Q1035917) (← links)
- Necessary optimality conditions for a class of nonsmooth vector optimization (Q1036898) (← links)
- Endogenous information acquisition in supply chain management (Q1037671) (← links)
