Výsledky vyhledávání - "Vector maximization algorithm"

Multi-criteria branch and bound: A vector maximization algorithm for Mixed 0-1 Multiple Objective Linear Programming

Autoři: Danae Diakoulaki George Mavrotas

Zdroj: Applied Mathematics and Computation. 171:53-71

Témata: 0209 industrial biotechnology, 0211 other engineering and technologies, 02 engineering and technology

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/S0096300305000809
https://core.ac.uk/display/38442433
https://dl.acm.org/doi/10.1016/j.amc.2005.01.038
https://dblp.uni-trier.de/db/journals/amc/amc171.html#MavrotasD05

On the strength of Lagrangian duality in multiobjective integer programming.

Autoři: Brun, Matthew Perini, Tyler Sinha, Saumya a další

Zdroj: Mathematical Programming; Jul2025, Vol. 212 Issue 1, p683-715, 33p

Témata: MULTI-objective optimization, INTEGER programming, INTEGERS

Solving multi-objective MILP problems in process synthesis using the multi-criteria branch and bound algorithm

Autoři: Mavrotas, G Diakoulaki, D

Témata: Branch and Bound Algorithm, Process Synthesis, Engineering, Chemical, Algorithms, Integer programming, Linear programming, Mathematical models, Nonlinear programming, Optimization, Problem solving, Synthesis (chemical), Mixed integer linear programming (MILP), Mixed integer non-linear programming (MINLP), Multi-objective programming problem, Vector maximization algorithm, Chemical engineering, algorithm

Relation: ISI:000234037500005; 28; 12; 1500; 1510

Dostupnost: https://doi.org/10.1002/ceat.200500135

Relaxations and duality for multiobjective integer programming.

Autoři: Dunbar, Alex Sinha, Saumya Schaefer, Andrew J.

Zdroj: Mathematical Programming; Sep2024, Vol. 207 Issue 1/2, p577-616, 40p

Témata: INTEGER programming, SET functions, INTEGERS, MOTIVATION (Psychology)

Augmenting bi-objective branch and bound by scalarization-based information.

Autoři: Bauß, Julius Stiglmayr, Michael

Zdroj: Mathematical Methods of Operations Research; Aug2024, Vol. 100 Issue 1, p85-121, 37p

Témata: BRANCH & bound algorithms, INTEGER programming, INTEGERS

Enhancing Branch-and-Bound for Multiobjective 0-1 Programming.

Autoři: Forget, Nicolas Parragh, Sophie N.

Zdroj: INFORMS Journal on Computing; Jan/Feb2024, Vol. 36 Issue 1, p285-304, 20p

Témata: KNAPSACK problems, BRANCH & bound algorithms

Multiple-objective as decisions in computing.

Autoři: Nasution, Mahyuddin K. M. Elveny, Marischa Syah, Rahmad

Zdroj: AIP Conference Proceedings; 5/12/2023, Vol. 2714 Issue 1, p1-7, 7p

Témata: INDUSTRY 4.0, MULTIPLE criteria decision making

An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems.

Autoři: Diessel, Erik

Zdroj: Optimization; Dec2022, Vol. 71 Issue 15, p4321-4366, 46p

Témata: APPROXIMATION algorithms, MIXED integer linear programming

A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy.

Autoři: Li, Hongming Li, Xintao

Zdroj: Mathematics (2227-7390); Dec2022, Vol. 10 Issue 24, p4705, 20p

Témata: CRANES (Machinery), ENERGY consumption, ALGORITHMS, SCHEDULING, INTEGER programming

Korporace: INTERNATIONAL Maritime Organization

Bi-objective optimisation over a set of convex sub-problems.

Autoři: Cabrera-Guerrero, Guillermo Ehrgott, Matthias Mason, Andrew J. a další

Zdroj: Annals of Operations Research; Dec2022, Vol. 319 Issue 2, p1507-1532, 26p

Témata: CONVEX sets, RADIOTHERAPY, POINT set theory, INTEGERS

Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey.

Autoři: Halffmann, Pascal Schäfer, Luca E. Dächert, Kerstin a další

Zdroj: Journal of Multi-Criteria Decision Analysis; Sep-Dec2022, Vol. 29 Issue 5/6, p341-363, 23p

Témata: ALGORITHMS, LINEAR programming

Bi-objective design-for-control of water distribution networks with global bounds.

Autoři: Ulusoy, Aly-Joy Pecci, Filippo Stoianov, Ivan

Zdroj: Optimization & Engineering; Mar2022, Vol. 23 Issue 1, p527-577, 51p

SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems.

Autoři: Rasmi, Seyyed Amir Babak Fattahi, Ali Türkay, Metin

Zdroj: Annals of Operations Research; Jan2021, Vol. 296 Issue 1/2, p841-876, 36p

Témata: LINEAR programming, STATISTICAL decision making, SUSTAINABLE engineering, DECISION making, POINT set theory

Multi-Objective Mixed Integer Programming: An Objective Space Algorithm.

Autoři: Pettersson, William Ozlen, Melih

Zdroj: AIP Conference Proceedings; 2019, Vol. 2070 Issue 1, p020039-1-020039-4, 4p

Témata: MIXED integer linear programming, ALGORITHMS, PARETO analysis, POLYTOPES, PARETO distribution

SOLVING MULTIOBJECTIVE MIXED INTEGER CONVEX OPTIMIZATION PROBLEMS.

Autoři: DE SANTIS, MARIANNA EICHFELDER, GABRIELE NIEBLING, JULIA a další

Zdroj: SIAM Journal on Optimization; 2020, Vol. 30 Issue 4, p3122-3145, 24p

Témata: INTEGERS, MATHEMATICAL programming, MATHEMATICAL optimization, CONVEX functions, CONVEX programming, DETERMINISTIC algorithms

A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising.

Autoři: Evangelista, Vivian M. Regis, Rommel G.

Zdroj: International Transactions in Operational Research; May2020, Vol. 27 Issue 3, p1664-1698, 35p, 4 Charts, 6 Graphs

Témata: INTEGER programming, ADVERTISING agencies, BRANDING (Marketing)

An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems.

Autoři: Turgut, Ozgu Dalkiran, Evrim Murat, Alper E.

Zdroj: Journal of Global Optimization; Sep2019, Vol. 75 Issue 1, p35-62, 28p

Témata: GOAL programming, INTEGER programming, PARALLEL algorithms, ALGORITHMS, SPACE

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach.

Autoři: Holzmann, Tim Smith, J. Cole

Zdroj: Naval Research Logistics; Apr2019, Vol. 66 Issue 3, p230-252, 23p

Témata: HUMAN trafficking, MATHEMATICAL optimization, COST functions, DIRECT costing, LINEAR programming

GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs.

Autoři: Rasmi, Seyyed Amir Babak Türkay, Metin

Zdroj: Optimization & Engineering; Mar2019, Vol. 20 Issue 1, p89-117, 29p

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming.

Autoři: Adelgren, Nathan Belotti, Pietro Gupte, Akshay

Zdroj: INFORMS Journal on Computing; Spring2018, Vol. 30 Issue 2, p324-338, 15p

Témata: MIXED integer linear programming, POLYHEDRA, MODULES (Algebra), PIECEWISE linear approximation, PARETO analysis