Search Results - "Biobjective mixed integer programming"

Exact solution algorithms for biobjective mixed integer programming problems

Authors: Deniz Emre Özlem Karsu Firdevs Ulus

Source: International Transactions in Operational Research.

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

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

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

Access URL: https://www.jstor.org/stable/45154806

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method

Authors: Tyler Perini Natashia Boland Diego Pecin et al.

Source: INFORMS Journal on Computing. 32:16-39

Subject Terms: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://pure.eur.nl/en/publications/976c3aa8-6703-4805-a2f7-ff8c0dfae66d
https://doi.org/10.1287/ijoc.2019.0887
http://doi.org/10.1287/ijoc.2019.0887
https://doi.org/10.1287/ijoc.2019.0887
https://dblp.uni-trier.de/db/journals/informs/informs32.html#PeriniBPS20
https://pubsonline.informs.org/doi/10.1287/ijoc.2019.0887

A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method

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

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

Source: INFORMS Journal on Computing. 27:597-618

Subject Terms: criterion space search algorithm, 2. Zero hunger, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, the triangle splitting method, 02 engineering and technology, 15. Life on land, biobjective mixed integer programming

Access URL: https://findanexpert.unimelb.edu.au/scholarlywork/1202138-a-criterion-space-search-algorithm-for-biobjective-mixed-integer-programming--the-triangle-splitting-method
https://ideas.repec.org/a/inm/orijoc/v27y2015i4p597-618.html
https://dblp.uni-trier.de/db/journals/informs/informs27.html#BolandCS15
https://core.ac.uk/display/78570658
https://pubsonline.informs.org/doi/abs/10.1287/ijoc.2015.0646
https://EconPapers.repec.org/RePEc:inm:orijoc:v:27:y:2015:i:4:p:597-618

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming

Authors: Nathan Adelgren Pietro Belotti Akshay Gupte

Source: Adelgren, N, Belotti, P & Gupte, A 2018, ' Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming ', INFORMS Journal on Computing, vol. 30, no. 2, pp. 324-338 . https://doi.org/10.1287/ijoc.2017.0783

Subject Terms: FOS: Computer and information sciences, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, 90C29, 68P05, 90C11, Biobjective mixed integer optimization, Optimization and Control (math.OC), Data structure, Computer Science - Data Structures and Algorithms, FOS: Mathematics, E.1.7, Data Structures and Algorithms (cs.DS), Pareto set, Mathematics - Optimization and Control

File Description: application/pdf

Access URL: https://www.pure.ed.ac.uk/ws/files/136886367/ijoc.2017.0783.pdf
http://arxiv.org/abs/1411.6538
https://www.research.ed.ac.uk/en/publications/efficient-storage-of-pareto-points-in-biobjective-mixed-integer-p
http://export.arxiv.org/pdf/1411.6538
http://ui.adsabs.harvard.edu/abs/2014arXiv1411.6538A/abstract
https://www.pure.ed.ac.uk/ws/files/136886367/ijoc.2017.0783.pdf
https://doi.org/10.1287/ijoc.2017.0783
https://dblp.uni-trier.de/db/journals/corr/corr1411.html#AdelgrenBG14
https://hdl.handle.net/20.500.11820/d9b54e3e-d3ab-4036-9b0d-ba1de731a467
https://www.pure.ed.ac.uk/ws/files/136886367/ijoc.2017.0783.pdf
https://hdl.handle.net/11311/1163722
https://doi.org/10.1287/ijoc.2017.0783

Nondominated Nash points: application of biobjective mixed integer programming

Authors: Hadi Charkhgard Martin Savelsbergh Masoud Talebian

Source: 4OR. 16:151-171

Subject Terms: 0211 other engineering and technologies, 02 engineering and technology

Access URL: https://dblp.uni-trier.de/db/journals/4or/4or16.html#CharkhgardST18
https://ideas.repec.org/a/spr/aqjoor/v16y2018i2d10.1007_s10288-017-0354-2.html
https://link.springer.com/article/10.1007/s10288-017-0354-2
https://rd.springer.com/article/10.1007%2Fs10288-017-0354-2

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

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

Source: 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 Terms: article

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

Effcient storage of Pareto solutions in biobjective mixed integer programming

Authors: Adelgren, Nathan Belotti, Pietro Gupte, Akshay

Source: Adelgren, N, Belotti, P & Gupte, A 2015, ' Effcient storage of Pareto solutions in biobjective mixed integer programming ', Paper presented at INFORMS Computing Society Conference, Richmond, United States, 11/01/15-13/01/15 .

File Description: application/pdf

Access URL: https://www.pure.ed.ac.uk/ws/files/150714330/ics2015_submission_73.pdf
https://hdl.handle.net/20.500.11820/a80bed42-784c-4c22-8e21-046a2a02553f

The Triangle Splitting Method for Biobjective Mixed Integer Programming

Authors: Natashia Boland Martin W. P. Savelsbergh Hadi Charkhgard

Source: Lecture Notes in Computer Science ISBN: 9783319075563

Subject Terms: 15. Life on land

Access URL: https://link.springer.com/chapter/10.1007/978-3-319-07557-0_14
https://rd.springer.com/chapter/10.1007/978-3-319-07557-0_14
https://dblp.uni-trier.de/db/conf/ipco/ipco2014.html#BolandCS14

Exact solution algorithms for biobjective mixed integer programming problems

Authors: Emre, Deniz Ulus, Firdevs

Contributors: Emre, Deniz Ulus, Firdevs

Subject Terms: Biobjective mixed integer linear programming, Pascoletti-Serafini scalarization, Exact solution algorithm

File Description: xi, 48 leaves : charts; 30 cm.; application/pdf

Access URL: https://hdl.handle.net/11693/53948

Efficient storage of Pareto points in biobjective mixed integer programming

Authors: Adelgren, Nathan Belotti, Pietro Gupte, Akshay

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

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

Nondominated points of biobjective mixed-integer programming problems

Authors: Fattahi, Ali Türkay, Metin Endüstri Mühendisliği Anabilim Dalı et al.

Contributors: Fattahi, Ali Türkay, Metin Endüstri Mühendisliği Anabilim Dalı et al.

Subject Terms: Nonlinear control theory, System analysis, Endüstri ve Endüstri Mühendisliği, Engineering mathematics, Industrial and Industrial Engineering

File Description: application/pdf; pdf

Access URL: https://acikbilim.yok.gov.tr/handle/20.500.12812/168109

EFFICIENT STORAGE OF PARETO POINTS IN BIOBJECTIVE MIXED INTEGER PROGRAMMING

Authors: Nathan Adelgren Pietro Belotti Akshay Gupte et al.

Contributors: Nathan Adelgren Pietro Belotti Akshay Gupte et al.

Source: http://arxiv.org/pdf/1411.6538.pdf.

File Description: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.761.2636; http://arxiv.org/pdf/1411.6538.pdf

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.761.2636
http://arxiv.org/pdf/1411.6538.pdf

Exact solution algorithms for biobjective mixed integer programming problems ; İki amaçlı karma doğrusal programlama problemleri için tam sonuç veren algoritmalar

Authors: Emre, Deniz Ulus, Firdevs

Contributors: Emre, Deniz Ulus, Firdevs

Subject Terms: Biobjective mixed integer linear programming, Exact solution algorithm, Pascoletti-Serafini scalarization

File Description: xi, 48 leaves : charts; 30 cm.; application/pdf

Relation: http://hdl.handle.net/11693/53948; B150415

Availability: http://hdl.handle.net/11693/53948

An Improved CPU Time in Triangle Splitting Method for Solving a Biobjective Mixed Integer Program

Authors: Santosh Kumar Al-Rabeeah Al-Rabeeah Ali Al-Hasani et al.

Source: International Journal of Mathematical, Engineering and Management Sciences, Vol 3, Iss 4, Pp 351-364 (2018)

Subject Terms: 2. Zero hunger, Technology, 0209 industrial biotechnology, Biobjective mixed integer programming, Nondominated frontiers, Exact algorithm for multi-objective optimization, QA1-939, 0211 other engineering and technologies, 02 engineering and technology, Mathematics

Access URL: https://doaj.org/article/2ef9628f396c4caa92921ba70578c650

A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method.

Authors: Perini, Tyler Boland, Natashia Pecin, Diego et al.

Source: INFORMS Journal on Computing; Winter2020, Vol. 32 Issue 1, p16-39, 24p

Subject Terms: INTEGER programming, GOAL programming, INTEGERS, SPACE, ALGORITHMS

The triangle splitting method for biobjective mixed integer programming

Authors: Boland, Natashia Charkhgard, Hadi Savelsbergh, Martin

Subject Terms: biobjective mixed integer program, triangle splitting method, efficient frontier

Relation: 17th Conference on Integer Programming and Combinatorial Optimization (IPCO 2014). Integer Programming and Combinatorial Optimization: 17th International Conference, IPCO 2014 Bonn, Germany, June 23-25, 2014 Proceedings (Bonn, Germany 23-25 June, 2014) p. 162-173; http://hdl.handle.net/1959.13/1356782; uon:31785

Availability: http://hdl.handle.net/1959.13/1356782

Maximum and set covering problem considering the internal structure of production units.

Authors: Azodi, Azam Fathali, Jafar Ghiyasi, Mojtaba et al.

Source: Journal of Modelling in Management; 2025, Vol. 20 Issue 3, p1102-1116, 15p

Subject Terms: DATA envelopment analysis, LOCATION data, INTEGER programming, POINT set theory, MANUFACTURING processes

Nondominated Nash points: application of biobjective mixed integer programming.

Authors: Charkhgard, Hadi Savelsbergh, Martin Talebian, Masoud

Source: 4OR (1619-4500); Jun2018, Vol. 16 Issue 2, p151-171, 21p

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming.

Authors: Adelgren, Nathan Belotti, Pietro Gupte, Akshay

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

Subject Terms: MIXED integer linear programming, POLYHEDRA, MODULES (Algebra), PIECEWISE linear approximation, PARETO analysis