Suchergebnisse - Multiobjective quadratic integer programming

A branch-and-cut technique to solve multiobjective integer quadratic programming problems von Ouaïl, Fatma Zohra, Chergui, Mohamed El-Amine

“… This article proposes an exact method to solve the integer programming problem featuring several convex quadratic functions to be minimized …”
Volltext

Using dual relaxations in multiobjective mixed-integer convex quadratic programming von De Santis, Marianna, Eichfelder, Gabriele, Patria, Daniele, Warnow, Leo

“… We present a branch-and-bound method for multiobjective mixed-integer convex quadratic programs that computes a superset of efficient integer assignments and a coverage of the nondominated set …”
Volltext

Multiobjective Mixed-Integer Quadratic Models: A Study on Mathematical Programming and Evolutionary Computation von Shir, Ofer M., Emmerich, Michael

“… To do so, this article compares a mathematical programming approach with an evolutionary method for set-oriented Pareto front approximation of bi-objective quadratic MI optimization …”
Volltext

A decision space algorithm for multiobjective convex quadratic integer optimization von De Santis, Marianna, Eichfelder, Gabriele

“… of the restricted objective functions. We show that the algorithm stops after finitely many fixings of variables with detecting both the full efficient and the nondominated set of multiobjective strictly convex quadratic integer problems …”
Volltext

Finding non dominated points for multiobjective integer convex programs with linear constraints von Zerfa, Lamia, Chergui, Mohamed El-Amine

“… In this paper, we present a branch-and-bound based algorithm to generate all non dominated points for a multiobjective integer programming problem with convex objective functions and linear constraints (MOICP …”
Volltext

An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program von Chaiblaine, Yacine, Moulaï, Mustapha

“… In this paper, we propose an exact method to optimize a quadratic function over the efficient set of a multiobjective integer linear fractional program MOILFP …”
Volltext

Preference-Aware Edge Server Placement in the Internet of Things von Chen, Yuanyi, Lin, Yihao, Zheng, Zengwei, Yu, Peng, Shen, Jiaxing, Guo, Minyi

“… While it is well understood that edge computing can significantly facilitate IoT-related applications by deploying edge servers close to IoT devices, it also …”
Volltext

A ranking algorithm for bi-objective quadratic fractional integer programming problems von Sharma, Vikas, Dahiya, Kalpana, Verma, Vanita

“… An algorithm to solve bi-objective quadratic fractional integer programming problems is presented in this paper …”
Volltext

Comparative Analysis of Load-Shaping-Based Privacy Preservation Strategies in a Smart Grid von Kement, Cihan Emre, Gultekin, Hakan, Tavli, Bulent, Girici, Tolga, Uludag, Suleyman

“… A key enabler for the smart grid is the fine-grained monitoring of power utilization. Although such a mechanism is helpful in the optimization of the whole …”
Volltext

A multiobjective optimization approach to smart growth in land development von Gabriel, Steven A., Faria, José A., Moglen, Glenn E.

“… s. The resulting optimization problems are convex, quadratic mixed integer programs that are NP-complete …”
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

User allocation‐aware edge cloud placement in mobile edge computing von Guo, Yan, Wang, Shangguang, Zhou, Ao, Xu, Jinliang, Yuan, Jie, Hsu, Ching‐Hsien

“… Specifically, we formulate it as a multiobjective optimization problem with objective to balance the workload between edge clouds and minimize the service communication delay of mobile users …”
Volltext

A parallel variable neighborhood search algorithm with quadratic programming for cardinality constrained portfolio optimization von Akbay, Mehmet Anil, Kalayci, Can B., Polat, Olcay

“… Cardinality constraints transform the quadratic optimization model into the mixed-integer quadratic programming problem, which is proved to be NP-Hard, making it harder to obtain an optimal solution …”
Volltext

Optimizing a linear function over the efficient set of a multiple objective integer quadratic program von Badjara, Mohamed El-Amine, Chergui, Mohamed El-Amine

Volltext

MF2-DMTD: A Formalism and Game-Based Reasoning Framework for Optimized Drone-Type Moving Target Defense von Seo, Sang, Lee, Jaeyeon, Kim, Byeongjin, Lee, Woojin, Kim, Dohoon

“… Moving-target-defense (MTD) fundamentally avoids an illegal initial compromise by asymmetrically increasing the uncertainty as the attack surface of the …”
Volltext

On efficiency and the Jain’s fairness index in integer assignment problems von Rezaeinia, Nahid, Góez, Julio C., Guajardo, Mario

“… Given two sets of objects, the integer assignment problem consists of assigning objects of one set to objects in the other …”
Volltext

A review of classical methods and Nature-Inspired Algorithms (NIAs) for optimization problems von Mandal, Pawan Kumar

“… Optimization techniques are among the most promising methods to deal with real-world problems, consisting of several objective functions and constraints. Over …”
Volltext

A new Probe Guided Mutation operator and its application for solving the cardinality constrained portfolio optimization problem von Liagkouras, K., Metaxiotis, K.

“… This paper revisits the classical Polynomial Mutation (PLM) operator and proposes a new probe guided version of the PLM operator designed to be used in conjunction with Multiobjective Evolutionary Algorithms (MOEAs …”
Volltext

Stackelberg-game-based modeling and optimization for supply chain design and operations: A mixed integer bilevel programming framework von Yue, Dajun, You, Fengqi

“… or quadratic programming followers’ problems. When discrete decisions are involved in the follower's problem, the resulting lower-level mixed-integer program prohibits direct transformation of the bilevel program into a single-level mathematical …”
Volltext

Min cost improvement and max gain stability in multicriteria sorting methods on combinatorial domains von Benabbou, Nawal, Martin, Hugo, Perny, Patrice

“… Various multicriteria sorting methods have been proposed in the literature to assign the feasible alternatives into predefined categories. We consider here …”
Volltext