Suchergebnisse - Biobjective integer programming

Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming

Autoren: Marianna De Santis Giorgio Grani Laura Palagi

Quelle: European journal of operational research 283 (2020): 57–69. doi:10.1016/j.ejor.2019.10.034
info:cnr-pdr/source/autori:De Santis, Marianna; Grani, Giorgio; Palagi, Laura/titolo:Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming/doi:10.1016%2Fj.ejor.2019.10.034/rivista:European journal of operational research/anno:2020/pagina_da:57/pagina_a:69/intervallo_pagine:57–69/volume:283

Schlagwörter: 0209 industrial biotechnology, multiobjective optimization, integer programming, criterion space search, Criterion space search, 0211 other engineering and technologies, Integer programming, 02 engineering and technology, Multiobjective optimization

Dateibeschreibung: application/pdf

Zugangs-URL: https://iris.uniroma1.it/retrieve/handle/11573/1345013/1319473/DeSantis_Preprint_Branching-with-hyperplanes_2020.pdf
https://dblp.uni-trier.de/db/journals/eor/eor283.html#SantisGP20
https://www.sciencedirect.com/science/article/pii/S0377221719308690
https://hdl.handle.net/11573/1290884
https://hdl.handle.net/2158/1350119

Solving the Air Conflict Resolution Problem Under Uncertainty Using an Iterative Biobjective Mixed Integer Programming Approach

Autoren: Lehouillier, Thibault Nasri, Moncef Ilies Soumis, François et al.

Quelle: Transportation Science, 2017 Nov 01. 51(4), 1242-1258.

Zugangs-URL: https://www.jstor.org/stable/45154806

A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method

Autoren: Boland, Natashia Charkhgard, Hadi Savelsbergh, Martin et al.

Weitere Verfasser: Boland, Natashia Charkhgard, Hadi Savelsbergh, Martin et al.

Quelle: INFORMS Journal on Computing. 27:735-754

Schlagwörter: criterion space search algorithm, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, biobjective integer programming, balanced box method

A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs

Autoren: Stidsen, Thomas Andersen, Kim Allan Dammann, Bernd

Quelle: Management Science, 2014 Apr 01. 60(4), 1009-1032.

Zugangs-URL: http://dx.doi.org/10.1287/mnsc.2013.1802

A criterion space method for biobjective mixed integer programming: the boxed line method

Autoren: Perini, T Boland, N Galindo Pecin, Diego et al.

Quelle: Perini, T, Boland, N, Galindo Pecin, D & Savelsbergh, M 2020, 'A criterion space method for biobjective mixed integer programming: the boxed line method', INFORMS Journal on Computing, vol. 32, no. 1, pp. 16-39.

Index Begriffe: article

URL: https://pure.eur.nl/en/publications/976c3aa8-6703-4805-a2f7-ff8c0dfae66d

Variants of the $$ \varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems

Autoren: Jesús Sáez-Aguado Paula Camelia Trandafir

Quelle: Mathematical Methods of Operations Research. 87:251-283

Schlagwörter: 13. Climate action, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 7. Clean energy

An exact algorithm for biobjective integer programming problems

Autoren: Doğan, Saliha Ferda Karsu, Özlem Ulus, Firdevs

Weitere Verfasser: Doğan, Saliha Ferda Karsu, Özlem Ulus, Firdevs

Quelle: Computers & Operations Research

Schlagwörter: Biobjective integer programming, Optimization and Control (math.OC), FOS: Mathematics, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Pascoletti-Serafini scalarization, Mathematics - Optimization and Control, Algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/pdf/1905.07428
http://arxiv.org/abs/1905.07428
https://www.sciencedirect.com/science/article/pii/S0305054821000903
https://doi.org/10.1016/j.cor.2021.105298
http://repository.bilkent.edu.tr/handle/11693/52327
https://hdl.handle.net/11693/77447

Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming

Autoren: Marianna De Santis Giorgio Grani Laura Palagi et al.

Weitere Verfasser: Marianna De Santis Giorgio Grani Laura Palagi et al.

Schlagwörter: multiobjective optimization, integer programming, criterion space search

Relation: ispartofbook:Technical Report n. 3, 2019; firstpage:1; lastpage:36; numberofpages:36; serie:DEPARTMENT OF COMPUTER, CONTROL, AND MANAGEMENT ENGINEERING ANTONIO RUBERTI TECHNICAL REPORTS; http://hdl.handle.net/11573/1290884

Verfügbarkeit: http://hdl.handle.net/11573/1290884

An exact algorithm for biobjective integer programming problems

Autoren: Doğan, Saliha Ferda Ulus, Firdevs Karsu, Özlem et al.

Weitere Verfasser: Doğan, Saliha Ferda Ulus, Firdevs Karsu, Özlem et al.

Schlagwörter: Biobjective integer programming, Endüstri ve Endüstri Mühendisliği, Pascoletti-Serafini scalarization, Algorithms, Industrial and Industrial Engineering

Dateibeschreibung: application/pdf; xii, 55 leaves : charts (some color); 30 cm.

Zugangs-URL: https://acikbilim.yok.gov.tr/handle/20.500.12812/33207
https://hdl.handle.net/11693/52327

Efficient storage of Pareto points in biobjective mixed integer programming

Autoren: Adelgren, Nathan Belotti, Pietro Gupte, Akshay

Index Begriffe: Computer Science - Data Structures and Algorithms, Mathematics - Optimization and Control, 90C29, 68P05, 90C11, E.1.7, text

URL: http://arxiv.org/abs/1411.6538

An Improved Algorithm for Biobjective Integer Programming and Its Application to Network Routing Problems

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.lehigh.edu/~tkr2/research/papers/BICRIT.ps.

Schlagwörter: biobjective programming, bicriteria optimization, multicriteria optimization, integer programming, discrete optimization, Pareto outcomes, nondominated outcomes, efficient solutions, scalarization, fixed-charge network flow, capacitated node routing, network design

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.4810; http://www.lehigh.edu/~tkr2/research/papers/BICRIT.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.4810
http://www.lehigh.edu/~tkr2/research/papers/BICRIT.ps

Variants of the ε-constraint method for biobjective integer programming problems: application to p-median-cover problems.

Autoren: Sáez-Aguado, Jesús Trandafir, Paula Camelia

Quelle: Mathematical Methods of Operations Research; Apr2018, Vol. 87 Issue 2, p251-283, 33p, 4 Diagrams, 7 Charts

Schlagwörter: INTEGER programming, PARETO analysis, CONSTRAINT algorithms, PROBLEM solving, OPERATIONS research

The Frontier Partitioner Algorithm: a Branch and Cut algorithm for Biobjective Integer Programming

Autoren: Santis, Marianna De Palagi, Laura Grani, Giorgio

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

A hybrid approach for biobjective optimization.

Autoren: Stidsen, Thomas Andersen, Kim Allan

Quelle: Discrete Optimization. May2018, Vol. 28, p89-114. 26p.

Schlagwörter: Mathematical optimization, Algorithms, Mixed integer linear programming, Fractions, Traveling salesman problem

BIOBJECTIVE INTEGER STOCHASTIC OPTIMIZATION OVER THE INTEGER STOCHASTIC EFFICIENT SET

Autoren: Badaoui, Ilias Moulaï, Mustapha Chaiblaine, Yacine et al.

Quelle: Pesquisa Operacional, Volume: 44, Article number: e281853, Published: 19 AUG 2024. August 2024

Schlagwörter: multi-objective programming, bi-objective programming, stochastic programming, optimization over an efficient set, two-stage stochastic programming, branch-and-cut

Dateibeschreibung: text/html

Zugangs-URL: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382024000100209&lng=en&tlng=en

Branch-and-bound for biobjective integer programming

Autoren: Parragh, Sophie N. Tricoire, Fabien

Quelle: Parragh, S N & Tricoire, F 2019, 'Branch-and-bound for biobjective integer programming', INFORMS Journal on Computing (JOC), vol. 31, pp. 805 - 822. https://doi.org/10.1287/ijoc.2018.0856

Relation: info:eu-repo/semantics/altIdentifier/pissn/1091-9856; info:eu-repo/semantics/altIdentifier/eissn/1526-5528

Verfügbarkeit: https://research.wu.ac.at/de/publications/fdb51fb5-0c88-4f14-9c86-e1ca5a9b7e20
https://doi.org/10.1287/ijoc.2018.0856
https://www.scopus.com/pages/publications/85078134261

Fathoming rules for biobjective mixed integer linear programs: Review and extensions.

Autoren: Belotti, Pietro Soylu, Banu Wiecek, Margaret M.

Quelle: Discrete Optimization. Nov2016 Part B, Vol. 22, p341-363. 23p.

Schlagwörter: Mixed integer linear programming, Polynomials, Mathematical optimization, Computational mathematics, Heuristic algorithms

Finding equidistant nondominated points for biobjective mixed integer programs

Autoren: Kidd, Martin Philip Lusby, Richard Martin Larsen, Jesper

Quelle: Kidd , M P , Lusby , R M & Larsen , J 2016 , Finding equidistant nondominated points for biobjective mixed integer programs .

Index Begriffe: book

URL: https://orbit.dtu.dk/en/publications/7ef68c73-e17c-4ea9-8c4f-5995e55ef78c
https://backend.orbit.dtu.dk/ws/files/127631418/equidistant.pdf

Transportation service procurement problem with transit time.

Autoren: Hu, Qian Zhang, Zhenzhen Lim, Andrew

Quelle: Transportation Research Part B: Methodological. Apr2016, Vol. 86, p19-36. 18p.

Schlagwörter: *TRANSPORTATION costs, *INTEGER programming, *INDUSTRIAL procurement, HEURISTIC algorithms, TRAVEL time (Traffic engineering)

Clean Water Network Design for Refugee Camps.

Autoren: Karsu, Özlem Kara, Bahar Y. Akkaya, Elif et al.

Quelle: Networks & Spatial Economics. Mar2021, Vol. 21 Issue 1, p175-198. 24p.

Schlagwörter: *INTEGER programming, REFUGEE camps, LOCATION problems (Programming), WATER distribution, WATER pipelines

Geografische Kategorien: GAZIANTEP (Turkey)