The following pages link to Margaret M. Wiecek (Q210407):
Displaying 43 items.
- A two-phase algorithm for the multiparametric linear complementarity problem (Q323406) (← links)
- Quadratic scalarization for decomposed multiobjective optimization (Q331788) (← links)
- 2D decision-making for multicriteria design optimization (Q373904) (← links)
- On the quality of discrete representations in multiple objective programming (Q374696) (← links)
- Biobjective optimization for analytical target cascading: optimality vs. achievability (Q381921) (← links)
- Efficiency for multiobjective multidisciplinary optimization problems with quasiseparable subproblems (Q400009) (← links)
- Connections between single-level and bilevel multiobjective optimization (Q415423) (← links)
- Generalized equitable preference in multiobjective programming (Q421565) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- Covers and approximations in multiobjective optimization (Q513168) (← links)
- An algorithm for approximating the Pareto set of the multiobjective set covering problem (Q513581) (← links)
- Constructing a Pareto front approximation for decision making (Q532529) (← links)
- Algebra of efficient sets for multiobjective complex systems (Q635798) (← links)
- PAINT: Pareto front interpolation for nonlinear multiobjective optimization (Q694527) (← links)
- Lagrangian coordination and analytical target cascading: Solving ATC-decomposed problems with Lagrangian duality (Q833393) (← links)
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming (Q857285) (← links)
- Relative importance of criteria in multiobjective programming: a cone-based approach (Q992699) (← links)
- Research support decisions under conditions of uncertainty and risk (Q1000006) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Augmented Lagrangian and Tchebycheff approaches in multiple objective programming (Q1304753) (← links)
- (Q1405556) (redirect page) (← links)
- Minimum effort approximation of the Pareto space of convex bi-criteria problems (Q1405558) (← links)
- Norm-based approximation in multicriteria programming. (Q1416300) (← links)
- Introducing oblique norms into multiple criteria programming (Q1598887) (← links)
- Robust multiobjective optimization with application to Internet routing (Q1730555) (← links)
- A tolerance function for the multiobjective set covering problem (Q1733317) (← links)
- Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
- Unbiased approximation in multicriteria optimization (Q1812292) (← links)
- Optimization of nonhierarchically decomposed problems (Q1947580) (← links)
- On highly robust efficient solutions to uncertain multiobjective linear programs (Q1991250) (← links)
- Theory, computation, and practice of multiobjective optimisation (Q2108797) (← links)
- Introducing multiobjective complex systems (Q2273915) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Exact generation of epsilon-efficient solutions in multiple objective programming (Q2460074) (← links)
- Cone characterizations of approximate solutions in real vector optimization (Q2471114) (← links)
- Saddle points and Pareto points in multiple objective programming (Q2569145) (← links)
- Approximation methods in multiobjective programming (Q2583199) (← links)
- On solving parametric multiobjective quadratic programs with parameters in general locations (Q2678592) (← links)
- Piecewise quadratic approximation of the non-dominated set for bi-criteria programs (Q2720018) (← links)
- Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria (Q3011189) (← links)
- (Q3112553) (← links)
- Interactive Coordination of Objective Decompositions in Multiobjective Programming (Q3117728) (← links)
- Detecting local convexity on the pareto surface (Q4803332) (← links)
