Výsledky vyhľadávania - Biobjective integer programming

Alternativne vyhľadávanie:

  1. 1

    Variants of the ε-constraint method for biobjective integer programming problems: application to p-median-cover problems Autor Sáez-Aguado, Jesús, Trandafir, Paula Camelia

    ISSN: 1432-2994, 1432-5217
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2018
    “…We conduct an in-depth analysis of the ε -constraint method (ECM) for finding the exact Pareto front for biobjective integer programming problems…”
    Získať plný text
    Journal Article
  2. 2

    Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming Autor De Santis, Marianna, Grani, Giorgio, Palagi, Laura

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Elsevier B.V 16.05.2020
    “… We present an algorithm for finding the complete Pareto frontier of biobjective integer programming problems…”
    Získať plný text
    Journal Article
  3. 3

    An exact algorithm for biobjective integer programming problems Autor Doğan, Saliha Ferda, Karsu, Özlem, Ulus, Firdevs

    ISSN: 0305-0548, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.08.2021
    Vydané v Computers & operations research (01.08.2021)
    “…•We propose an exact solution algorithm for biobjective integer programming problems…”
    Získať plný text
    Journal Article
  4. 4

    Exact solution algorithms for biobjective mixed integer programming problems Autor Emre, Deniz, Karsu, Özlem, Ulus, Firdevs

    ISSN: 0969-6016, 1475-3995
    Vydavateľské údaje: 13.08.2025
    “…We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points…”
    Získať plný text
    Journal Article
  5. 5

    Heuristic approaches for biobjective mixed 0–1 integer linear programming problems Autor Soylu, Banu

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Amsterdam Elsevier B.V 16.09.2015
    “…In this study, biobjective mixed 0–1 integer linear programming problems are considered and two heuristic approaches are presented to find the Pareto frontier of these problems…”
    Získať plný text
    Journal Article
  6. 6

    On the exactness of the ε-constraint method for biobjective nonlinear integer programming Autor De Santis, Marianna, Eichfelder, Gabriele, Patria, Daniele

    ISSN: 0167-6377, 1872-7468
    Vydavateľské údaje: Elsevier B.V 01.05.2022
    Vydané v Operations research letters (01.05.2022)
    “… We explore how to properly define the step size parameter of the method in order to guarantee its exactness when dealing with biobjective nonlinear integer problems…”
    Získať plný text
    Journal Article
  7. 7

    An exact algorithm for biobjective mixed integer linear programming problems Autor Soylu, Banu, Yıldız, Gazi Bilal

    ISSN: 0305-0548, 1873-765X, 0305-0548
    Vydavateľské údaje: New York Elsevier Ltd 01.08.2016
    Vydané v Computers & operations research (01.08.2016)
    “…In this study, we develop a new criterion space search algorithm to find the Pareto frontier of biobjective mixed-integer linear programming problems…”
    Získať plný text
    Journal Article
  8. 8
  9. 9

    A Biobjective Perspective for Mixed-Integer Programming Autor Liu, Jiao, Wang, Yong, Xin, Bin, Wang, Ling

    ISSN: 2168-2216, 2168-2232
    Vydavateľské údaje: New York IEEE 01.04.2022
    “…A mixed-integer programming (MIP) problem contains not only constraints but also integer restrictions…”
    Získať plný text
    Journal Article
  10. 10

    The search-and-remove algorithm for biobjective mixed-integer linear programming problems Autor Soylu, Banu

    ISSN: 0377-2217, 1872-6860
    Vydavateľské údaje: Elsevier B.V 01.07.2018
    “…•Biobjective mixed-integer linear programming problems are considered.•The search-and-remove algorithm computes the Pareto frontier exactly…”
    Získať plný text
    Journal Article
  11. 11

    Nondominated Nash points: application of biobjective mixed integer programming Autor Charkhgard, Hadi, Savelsbergh, Martin, Talebian, Masoud

    ISSN: 1619-4500, 1614-2411
    Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2018
    Vydané v 4OR (01.06.2018)
    “…We study the connection between biobjective mixed integer linear programming and normal form games with two players…”
    Získať plný text
    Journal Article
  12. 12

    Mixed integer biobjective quadratic programming for maximum-value minimum-variability fleet availability of a unit of mission aircraft Autor Gavranis, Andreas, Kozanidis, George

    ISSN: 0360-8352
    Vydavateľské údaje: Elsevier Ltd 01.08.2017
    Vydané v Computers & industrial engineering (01.08.2017)
    “…•The aim is to maximize the fleet availability over a multi-period planning horizon.•We develop a biobjective quadratic model that also balances the availability…”
    Získať plný text
    Journal Article
  13. 13

    An Exact Algorithm for Biobjective Integer Programming Problems Autor Doğan, Saliha Ferda

    ISBN: 9798209969020
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2019
    “…We propose an exact algorithm to find all nondominated points of biobjective integer programming problems, which arise in various applications of operations research…”
    Získať plný text
    Dissertation
  14. 14

    OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming Autor Sierra‐Altamiranda, Alvaro, Charkhgard, Hadi

    ISSN: 0969-6016, 1475-3995
    Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.03.2020
    “…We present OOESAlgorithm.jl, a package for optimizing a linear function over the efficient set of biobjective mixed integer linear programs…”
    Získať plný text
    Journal Article
  15. 15

    Metro timetable optimisation for minimising carbon emission and passenger time: a bi-objective integer programming approach Autor Wang, Huan, Yang, Xin, Wu, Jianjun, Sun, Huijun, Gao, Ziyou

    ISSN: 1751-956X, 1751-9578
    Vydavateľské údaje: The Institution of Engineering and Technology 01.09.2018
    Vydané v IET intelligent transport systems (01.09.2018)
    “… Secondly, a bi-objective integer programming model with dwell…”
    Získať plný text
    Journal Article
  16. 16

    A Hybrid Biobjective Markov Chain Based Optimization Model for Sustainable Aggregate Production Planning Autor Tirkolaee, Erfan Babaee, Aydin, Nadi Serhan, Mahdavi, Iraj

    ISSN: 0018-9391, 1558-0040
    Vydavateľské údaje: New York IEEE 2024
    “… For this purpose, a hybrid biobjective mixed-integer nonlinear programming model featuring a continuous-time Markov chain to accommodate the inventory decision process is developed…”
    Získať plný text
    Journal Article
  17. 17

    Exact Solution Algorithms for Biobjective Mixed Integer Programming Problems Autor Emre, Deniz

    ISBN: 9798209943839
    Vydavateľské údaje: ProQuest Dissertations & Theses 01.01.2020
    “…In this thesis, objective space based exact solution algorithms for biobjective mixed integer programming problems are proposed…”
    Získať plný text
    Dissertation
  18. 18

    A robust biobjective optimization approach for operating a shared energy storage under price uncertainty Autor Dai, Rui, Charkhgard, Hadi, Rigterink, Fabian

    ISSN: 0969-6016, 1475-3995
    Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.05.2022
    “…Energy storage (ES) is acknowledged to play an important role in modern energy technologies due to its potential to reduce operational costs, enhance the…”
    Získať plný text
    Journal Article
  19. 19

    A Biobjective Fuzzy Integer-Nonlinear Programming Approach for Creating an Intelligent Location-Aware Service Autor Lin, Yu-Cheng, Toly Chen, Tin-Chih

    ISSN: 1110-757X, 1687-0042
    Vydavateľské údaje: Cairo, Egypt Hindawi Limiteds 01.01.2013
    Vydané v Journal of Applied Mathematics (01.01.2013)
    “…; the other is to get to the destination as soon as possible. To consider the two objectives at the same time and to allow for the uncertainty in the dynamic environment, a biobjective fuzzy integer-nonlinear programming problem is formulated and solved…”
    Získať plný text
    Journal Article
  20. 20

    An exact algorithm for biobjective integer programming problems Autor Doğan, Saliha, Karsu, Özlem, Ulus, Firdevs

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 28.04.2021
    Vydané v arXiv.org (28.04.2021)
    “…We propose an exact algorithm for solving biobjective integer programming problems, which arise in various applications of operations research…”
    Získať plný text
    Paper