Suchergebnisse - Biobjective integer programming

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

“… We conduct an in-depth analysis of the ε -constraint method (ECM) for finding the exact Pareto front for biobjective integer programming problems …”
Volltext

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

“… We present an algorithm for finding the complete Pareto frontier of biobjective integer programming problems …”
Volltext

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

“… •We propose an exact solution algorithm for biobjective integer programming problems …”
Volltext

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

“… 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 …”
Volltext

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

“… 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 …”
Volltext

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

“… 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 …”
Volltext

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

“… In this study, we develop a new criterion space search algorithm to find the Pareto frontier of biobjective mixed-integer linear programming problems …”
Volltext

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

Volltext

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

“… A mixed-integer programming (MIP) problem contains not only constraints but also integer restrictions …”
Volltext

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

“… •Biobjective mixed-integer linear programming problems are considered.•The search-and-remove algorithm computes the Pareto frontier exactly …”
Volltext

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

“… We study the connection between biobjective mixed integer linear programming and normal form games with two players …”
Volltext

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

“… •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 …”
Volltext

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

“… We propose an exact algorithm to find all nondominated points of biobjective integer programming problems, which arise in various applications of operations research …”
Volltext

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

“… We present OOESAlgorithm.jl, a package for optimizing a linear function over the efficient set of biobjective mixed integer linear programs …”
Volltext

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

“… Secondly, a bi-objective integer programming model with dwell …”
Volltext

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

“… 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 …”
Volltext

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

“… In this thesis, objective space based exact solution algorithms for biobjective mixed integer programming problems are proposed …”
Volltext

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

“… Energy storage (ES) is acknowledged to play an important role in modern energy technologies due to its potential to reduce operational costs, enhance the …”
Volltext

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

“… ; 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 …”
Volltext

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

“… We propose an exact algorithm for solving biobjective integer programming problems, which arise in various applications of operations research …”
Volltext