The triangle splitting method for biobjective mixed integer programming

Title: The triangle splitting method for biobjective mixed integer programming
Creator: Boland, Natashia; Charkhgard, Hadi; Savelsbergh, Martin
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
Publisher Link: http://dx.doi.org/10.1007/978-3-319-07557-0_14
Publisher: Springer
Resource Type: conference paper
Date: 2014
Description: We present the first criterion space search algorithm, the triangle splitting method, for finding the efficient frontier of a biobjective mixed integer program. The algorithm is relatively easy to implement and converges quickly to the complete set of nondominated points. A computational study demonstrates the efficacy of the triangle splitting method.
Subject: biobjective mixed integer program; triangle splitting method; efficient frontier
Identifier: http://hdl.handle.net/1959.13/1356782
Identifier: uon:31785
Identifier: ISBN:9783319075563
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format