Search Results - multiple objective programming metaheuristics set packaging problem hybrid method

  • Showing 1 - 15 results of 15
Refine Results
  1. 1

    Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems by Gagné, C, Gravel, M, Price, W L

    ISSN: 0160-5682, 1476-9360
    Published: Basingstoke Taylor & Francis 01.06.2005
    “…In this paper, we propose a generic approach to find compromise solutions for multiple-objective scheduling problems using metaheuristics…”
    Get full text
    Journal Article
  2. 2
  3. 3
  4. 4

    Do multiple-objective metaheuristics deliver on their promises? A computational experiment on the set-covering problem by Jaszkiewicz, A.

    ISSN: 1089-778X, 1941-0026
    Published: New York IEEE 01.04.2003
    “…) and their single-objective counterparts on the multiple-objective set-covering problem (MOSCP). We use a methodology that allows consistent evaluation of the quality…”
    Get full text
    Journal Article
  5. 5

    A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm by Jaszkiewicz, Andrzej

    ISSN: 0254-5330, 1572-9338
    Published: New York Springer Nature B.V 01.10.2004
    Published in Annals of operations research (01.10.2004)
    “…The paper describes a comparative study of multiple-objective metaheuristics on the bi-objective set covering problem…”
    Get full text
    Journal Article
  6. 6

    On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem by Sun, Erjiang

    ISSN: 0022-3239, 1573-2878
    Published: New York Springer US 01.01.2017
    “…In this paper, we provide a mixed-integer programming approach for solving the problem of minimizing a real-valued function over the efficient set of a multiple objective linear program problem…”
    Get full text
    Journal Article
  7. 7

    Optimization over the efficient set of a parametric multiple objective linear programming problem by Tu, Ta Van

    ISSN: 0377-2217, 1872-6860
    Published: Amsterdam Elsevier B.V 01.05.2000
    Published in European journal of operational research (01.05.2000)
    “…In this paper we consider the problem ( P) for optimizing a function over the efficient set of a multiple objective linear programming (MOLP…”
    Get full text
    Journal Article
  8. 8

    Interactive partitioning criteria set algorithms for multiple objective linear programming problems by Kang, Myungkoo

    ISBN: 9798207249537
    Published: ProQuest Dissertations & Theses 01.01.1991
    “…The purpose of the dissertation is to provide an appropriate solution strategy for multicriteria linear programming problems where a heavy cognitive burden on the DM is expected when the entire…”
    Get full text
    Dissertation
  9. 9

    On a fuzzy set approach to solving multiple objective linear fractional programming problem by Stancu-Minasian, I.M., Pop, Bogdana

    ISSN: 0165-0114, 1872-6801
    Published: Amsterdam Elsevier B.V 16.03.2003
    Published in Fuzzy sets and systems (16.03.2003)
    “…In 1984, Luhandjula used a linguistic variable approach in order to present a procedure for solving multiple objective linear fractional programming problem (MOLFPP…”
    Get full text
    Journal Article
  10. 10

    Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem by Q. Tuyen, Hoang, D. Muu, Le

    ISSN: 0167-6377, 1872-7468
    Published: Elsevier B.V 01.03.2001
    Published in Operations research letters (01.03.2001)
    “…We formulate the problem of optimizing a convex function over the weakly efficient set of a multicriteria affine fractional program as a special biconvex problem…”
    Get full text
    Journal Article
  11. 11

    A common formula to compute the efficient sets of a class of multiple objective linear programming problems by Tu, Ta Van

    ISSN: 0233-1934, 1029-4945
    Published: Philadelphia Taylor & Francis 03.10.2015
    Published in Optimization (03.10.2015)
    “…Finding the efficient set of a multiple objective linear programming (MOLP) problem is difficult and finding the efficient sets of many MOLP problems is still more difficult…”
    Get full text
    Journal Article
  12. 12

    A Bilinear Algorithm for Optimizing a Linear Function over the Efficient Set of a Multiple Objective Linear Programming Problem by Jorge, Jesús M.

    ISSN: 0925-5001, 1573-2916
    Published: Dordrecht Springer Nature B.V 01.01.2005
    Published in Journal of global optimization (01.01.2005)
    “…The problem Q of optimizing a linear function over the efficient set of a multiple objective linear program serves several useful purposes in multiple criteria decision making…”
    Get full text
    Journal Article
  13. 13

    An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem by Benson, Harold P.

    ISSN: 0925-5001, 1573-2916
    Published: Boston Springer US 01.03.2012
    Published in Journal of global optimization (01.03.2012)
    “…This article presents for the first time an algorithm specifically designed for globally minimizing a finite, convex function over the weakly efficient set of a multiple objective nonlinear programming problem (V1…”
    Get full text
    Journal Article
  14. 14

    An interactive method by founding weights via bargaining sets to solve the multiple objective linear programming problems by Ahlatcioglu, M., Tiryaki, F.

    ISBN: 1890843067, 9781890843069
    Published: IEEE 2001
    “…In this paper, the authors consider the multiple objective linear programming (MOLP) problem which is defined as a linear type of the multiple objective mathematical programming…”
    Get full text
    Conference Proceeding
  15. 15

    An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem by Benson, Harold P.

    ISSN: 0925-5001, 1573-2916
    Published: Dordrecht Springer Nature B.V 1998
    Published in Journal of global optimization (1998)
    “…Various difficulties have been encountered in using decision set-based vector maximization methods to solve a multiple objective linear programming problem (MOLP…”
    Get full text
    Journal Article