Margaret M. Wiecek

Author Info

Name	Affiliation	Papers
MARGARET M. WIECEK	Department of Mathematical Sciences, Clemson University, 0-106 Martin Hall, Box 340975, Clemson, SC 29634, USA	36
Collaborators	Citations	PageRank
54	213	22.90
Referers	Referees	References
387	428	318

Search Limit

100428

Publications (36 rows)

Collaborators (54 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Introducing Multiobjective Complex Systems	0	0.34	2020
On highly robust efficient solutions to uncertain multiobjective linear programs.	1	0.35	2019
Planning the Shortest Path in Cluttered Environments: A Review and a Planar Convex Hull Based Approach	0	0.34	2019
A tolerance function for the multiobjective set covering problem	0	0.34	2019
Personalized Multiobjective Optimization: An Analytics Perspective (Dagstuhl Seminar 18031).	0	0.34	2018
Robust multiobjective optimization with application to Internet routing.	1	0.36	2018
An algorithm for approximating the Pareto set of the multiobjective set covering problem.	1	0.36	2017
Covers and approximations in multiobjective optimization.	5	0.43	2017
A two-phase algorithm for the multiparametric linear complementarity problem.	0	0.34	2016
Fathoming rules for biobjective mixed integer linear programs: Review and extensions	1	0.36	2016
Quadratic scalarization for decomposed multiobjective optimization	0	0.34	2016
Distributed Computation of Pareto Sets	2	0.42	2015
PAINT: Pareto front interpolation for nonlinear multiobjective optimization.	19	0.71	2012
Generating equidistant representations in biobjective programming	4	0.45	2012
Connections Between Single-Level and Bilevel Multiobjective Optimization.	4	0.45	2012
Computing trade-offs in robust design: Perspectives of the mean squared error	5	0.49	2011
Constructing a Pareto front approximation for decision making	9	0.57	2011
Algebra of Efficient Sets for Multiobjective Complex Systems	5	0.61	2011
Generalized equitable preference in multiobjective programming	3	0.45	2011
Relative importance of criteria in multiobjective programming: A cone-based approach	5	0.50	2010
Labeling algorithms for multiple objective integer knapsack problems	12	0.77	2010
A review of different perspectives on uncertainty and risk and an alternative modeling paradigm	8	0.90	2009
Decomposition and Coordination for Multiobjective Complex Systems.	0	0.34	2009
09041 Working Group on MCDM for Robust Multiobjective Optimization (1st Round).	0	0.34	2009
Interactive Coordination of Objective Decompositions in Multiobjective Programming	12	0.84	2008
Generating epsilon-efficient solutions in multiobjective programming	23	1.61	2007
Exact generation of epsilon-efficient solutions in multiple objective programming	6	0.65	2007
An improved algorithm for solving biobjective integer programs	27	1.32	2006
Promoting epsilon-Efficiency in Multiple Objective Programming: Theory, Methodology, and Application	0	0.34	2006
Saddle Points and Pareto Points in Multiple Objective Programming	3	0.56	2005
Unbiased approximation in multicriteria optimization	20	1.75	2003
A Bi-Objective Median Location Problem With a Line Barrier	6	0.53	2002
Introducing oblique norms into multiple criteria programming	10	1.23	2002
A time-dependent multiple criteria single-machine scheduling problem	4	0.62	2001
Norm-Based Approximation in Bicriteria Programming	11	1.96	2001
Augmented Lagrangian and Tchebycheff Approaches in Multiple Objective Programming	6	0.62	1999