The reviewed record of science sign in
Pith

arxiv: 2607.00611 · v1 · pith:6AI2QWQ3 · submitted 2026-07-01 · math.OC

An semidefinite programming-based varepsilon-constraint method for the bi-objective single-row facility layout problem

Christof Brandstetter , Elisabeth Gaar , Markus Sinnl This is my paper

Reviewed by Pith2026-07-02 08:39 UTCgrok-4.3pith:6AI2QWQ3open to challenge →

classification math.OC
keywords single-row facility layout problembi-objective optimizationepsilon-constraint methodsemidefinite programmingbranch-and-boundPareto optimalityfacility layout
0
0 comments X

The pith

An SDP-based branch-and-bound procedure inside the ε-constraint method solves the bi-objective single-row facility layout problem.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper extends the single-row facility layout problem to two simultaneous weighted-distance objectives and seeks Pareto optimal arrangements. It replaces black-box integer linear programming solvers inside the ε-constraint method with an internal branch-and-bound routine that relies on semidefinite programming relaxations. This internal control makes non-binary branching and cross-iteration node reuse feasible. A computational study confirms that the custom steps improve performance on the resulting sequence of single-objective instances.

Core claim

The authors establish that the bi-objective single-row facility layout problem can be solved by an ε-constraint method whose subproblems are handled by a custom branch-and-bound algorithm using semidefinite programming relaxations rather than external integer linear programming solvers. Because the solver is not treated as a black box, non-binary branching and reuse of nodes from earlier ε-constraint iterations become possible. The resulting procedure is shown through experiments to be effective for computing Pareto fronts.

What carries the argument

A custom branch-and-bound procedure based on semidefinite programming relaxations, embedded inside the ε-constraint method to generate Pareto solutions for the bi-objective SRFLP.

If this is right

  • The bi-objective SRFLP reduces to a sequence of single-objective problems whose ε bounds are adjusted to trace the Pareto front.
  • Non-binary branching becomes available because the branch-and-bound routine is implemented internally rather than called as a black box.
  • Nodes explored for one ε value can be reused for nearby ε values, cutting redundant work across the method's iterations.
  • Tighter SDP bounds prune more of the search tree than linear programming bounds would in the same layout subproblems.
  • The approach yields measurable runtime gains on standard SRFLP test instances when the custom enhancements are activated.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same internal SDP branch-and-bound could be inserted into other scalarization schemes such as the weighted-sum method for the same problem class.
  • Node-reuse logic might extend naturally to adaptive or dynamic choices of the ε sequence rather than a fixed grid.
  • Problem-specific relaxations that beat generic linear programming bounds may unlock similar custom branching or reuse tactics in other combinatorial layout or ordering problems.
  • The computational advantage should be largest on instances where the SDP relaxation gap is substantially smaller than the linear programming gap.

Load-bearing premise

Semidefinite programming relaxations are more effective than linear programming relaxations of integer linear programs for solving single-row facility layout problems.

What would settle it

A head-to-head comparison on the same benchmark instances showing that an off-the-shelf integer linear programming solver inside the ε-constraint method returns the full Pareto front in less total time than the SDP-based version.

Figures

Figures reproduced from arXiv: 2607.00611 by Christof Brandstetter, Elisabeth Gaar, Markus Sinnl.

Figure 1
Figure 1. Figure 1: ECDFs of the runtimes for different settings of our algorithm over [PITH_FULL_IMAGE:figures/full_fig_p020_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Time (a) and number of B&B nodes (b) processed to determine the individual nondominated [PITH_FULL_IMAGE:figures/full_fig_p020_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: ECDFs of the runtimes for different branching strategies of our algorithm over [PITH_FULL_IMAGE:figures/full_fig_p022_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Time (a) and number of B&B nodes processed (b) to determine the individual nondominated [PITH_FULL_IMAGE:figures/full_fig_p022_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: ECDFs of the runtimes of different settings of our algorithm and off-the-shelf ILP solvers over [PITH_FULL_IMAGE:figures/full_fig_p023_5.png] view at source ↗
read the original abstract

In this work, we introduce a multi-objective version of the well-known single-row facility layout problem (SRFLP). In the SRFLP, a set of one-dimensional facilities should be placed along a single line such that the weighted sum of the center-to-center distances of each pair of facilities is minimized. In our multi-objective extension, there are multiple such weighted-sum objectives which we consider under the concept of Pareto optimality. We develop a solution algorithm based on the $\varepsilon$-constraint method to solve the bi-objective SRFLP. Many existing works on the $\varepsilon$-constraint method use integer linear programming (ILP) solvers in a black-box fashion for solving the problems at the individual iterations of the method. In contrast to that, we use our own branch-and-bound procedure based on semidefinite programming (SDP), as SDP relaxations are known to be more effective for solving the SRFLP than linear programming relaxations of ILPs. This allows us to propose several enhancements procedures for our $\varepsilon$-constraint approach, such as non-binary branching and reusing of nodes within the branch-and-bound trees, which are usually not possible when using black-box solvers. We present a computational study to demonstrate the effectiveness of our solution approach and its enhancements.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript introduces a bi-objective extension of the single-row facility layout problem (SRFLP) under Pareto optimality. It develops an ε-constraint algorithm that embeds a custom branch-and-bound procedure relying on semidefinite programming (SDP) relaxations, rather than black-box ILP solvers, thereby enabling enhancements such as non-binary branching and node reuse across the ε-constraint iterations. Effectiveness is supported by a computational study.

Significance. If the reported computational gains hold, the work provides a concrete demonstration that custom SDP-based solvers can be integrated into multi-objective frameworks to unlock solver-specific enhancements unavailable with black-box methods. This builds directly on established SDP tightness results for single-objective SRFLP and extends them to the bi-objective setting with reproducible algorithmic modifications.

minor comments (3)
  1. [Abstract] Abstract: the claim of effectiveness via computational study is stated without any indication of instance sizes, number of facilities tested, or quantitative metrics (e.g., number of Pareto points found or runtime ratios); adding one or two summary statistics would strengthen the abstract.
  2. [§2 or §3] The bi-objective formulation is introduced in the abstract but the precise mathematical statement (objective functions and decision variables) should be given explicitly with equation numbers in §2 or §3 to allow direct comparison with the single-objective SRFLP.
  3. [Algorithm description section] Ensure that the description of node reuse across different ε-values includes a short correctness argument (e.g., how lower bounds remain valid when the right-hand side of the ε-constraint changes).

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of our work and for recommending minor revision. No major comments were listed in the report, so we have no specific points requiring response or revision at this stage.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper develops an ε-constraint algorithm embedding a custom SDP-based branch-and-bound solver for the bi-objective SRFLP, citing the known superiority of SDP relaxations over LP relaxations from prior single-objective SRFLP literature. This citation is external and not load-bearing within the present work; the custom solver simply enables standard enhancements (non-binary branching, node reuse) that black-box ILP solvers cannot provide. Effectiveness is shown via a separate computational study rather than any fitted parameter or self-referential prediction. No equation, definition, or claim reduces by construction to inputs internal to this manuscript, satisfying the self-contained criterion.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the approach relies on the background claim that SDP relaxations dominate LP relaxations for SRFLP, but no new entities or fitted constants are introduced in the provided text.

pith-pipeline@v0.9.1-grok · 5760 in / 1249 out tokens · 26560 ms · 2026-07-02T08:39:59.397643+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

90 extracted references · 90 canonical work pages

  1. [1]

    and Kennings, Andrew and Vannelli, Anthony , opturldate =

    Anjos, Miguel F. and Kennings, Andrew and Vannelli, Anthony , opturldate =. A semidefinite optimization approach for the single-row layout problem with unequal dimensions , volume =. Discrete Optimization , shortjournal =. 2005 , langid =

    work page 2005

  2. [2]

    Mathematical Programming , year=

    Fischer, Ilse and Gruber, Gerald and Rendl, Franz and Sotirov, Renata , title=. Mathematical Programming , year=

    work page

  3. [3]

    A computational study and survey of methods for the single-row facility layout problem , volume =

    Hungerländer, Philipp and Rendl, Franz , opturldate =. A computational study and survey of methods for the single-row facility layout problem , volume =. Computational Optimization and Applications , shortjournal =. 2013 , langid =

    work page 2013

  4. [4]

    and Vannelli, Anthony , opturldate =

    Anjos, Miguel F. and Vannelli, Anthony , opturldate =. Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes , volume =. INFORMS Journal on Computing , shortjournal =. 2008 , langid =

    work page 2008

  5. [5]

    and Yen, Ginger , opturldate =

    Anjos, Miguel F. and Yen, Ginger , opturldate =. Provably near-optimal solutions for very large single-row facility layout problems , volume =. Optimization Methods and Software , shortjournal =. 2009 , langid =

    work page 2009

  6. [6]

    Semidefinite relaxations of ordering problems , volume =

    Hungerländer, Philipp and Rendl, Franz , opturldate =. Semidefinite relaxations of ordering problems , volume =. Mathematical Programming , shortjournal =. 2013 , langid =

    work page 2013

  7. [7]

    Multi-objective branch and bound , volume =

    Przybylski, Anthony and Gandibleux, Xavier , opturldate =. Multi-objective branch and bound , volume =. European Journal of Operational Research , shortjournal =. 2017 , langid =

    work page 2017

  8. [8]

    Amaral, André R. S. , opturldate =. A new lower bound for the single row facility layout problem , volume =. Discrete Applied Mathematics , shortjournal =. 2009 , langid =

    work page 2009

  9. [9]

    Cones of matrices and set-functions and 0--1 optimization , volume =

    Lovász, László and Schrijver, Alexander , opturldate =. Cones of matrices and set-functions and 0--1 optimization , volume =. SIAM Journal on Optimization , shortjournal =. 1991 , langid =

    work page 1991

  10. [10]

    Integer Programming , year =

    Conforti, Michele and Cornuéjols, Gérard and Zambelli, Giacomo , title =. Integer Programming , year =

    work page

  11. [11]

    Gaar, Elisabeth and Puges, Diane and Wiegele, Angelika , year =. Strong. Computers & Operations Research , shortjournal =

    work page

  12. [12]

    Mathematical Programming Computation , year =

    Lubin, Miles and Dowson, Oscar and. Mathematical Programming Computation , year =

    work page

  13. [13]

    2005 , publisher =

    Multicriteria Optimization , author =. 2005 , publisher =

    work page 2005

  14. [14]

    IEEE Transactions on Systems, Man, and Cybernetics , year =

    On a bicriterion formulation of the problems of integrated system identification and system optimization , author =. IEEE Transactions on Systems, Man, and Cybernetics , year =

    work page

  15. [15]

    A hybrid approach for biobjective optimization , volume =

    Stidsen, Thomas and Andersen, Kim Allan , year =. A hybrid approach for biobjective optimization , volume =. Discrete Optimization , shortjournal =

    work page

  16. [16]

    Multi-objective integer programming: A general approach for generating all non-dominated solutions , volume =

    Özlen, Melih and Azizoğlu, Meral , year =. Multi-objective integer programming: A general approach for generating all non-dominated solutions , volume =. European Journal of Operational Research , shortjournal =

    work page

  17. [17]

    Foundations of Computing and Decision Sciences , author =

    The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems , volume =. Foundations of Computing and Decision Sciences , author =. 1995 , optdoi =

    work page 1995

  18. [18]

    A branch and bound algorithm for mixed zero-one multiple objective linear programming , volume =

    Mavrotas, George and Diakoulaki, Dana , year =. A branch and bound algorithm for mixed zero-one multiple objective linear programming , volume =. European Journal of Operational Research , shortjournal =

    work page

  19. [19]

    Multi-criteria branch and bound: A vector maximization algorithm for mixed 0-1 multiple objective linear programming , volume =

    Mavrotas, George and Diakoulaki, Dana , year =. Multi-criteria branch and bound: A vector maximization algorithm for mixed 0-1 multiple objective linear programming , volume =. Applied Mathematics and Computation , shortjournal =

    work page

  20. [20]

    Management Science , volume =

    Stidsen, Thomas and Andersen, Kim Allan and Dammann, Bernd , title =. Management Science , volume =. 2014 , optdoi =

    work page 2014

  21. [21]

    , year =

    Belotti, Pietro and Soylu, Banu and Wiecek, Margaret M. , year =. Fathoming rules for biobjective mixed integer linear programs: Review and extensions , volume =. Discrete Optimization , shortjournal =

    work page

  22. [22]

    An algorithm for the multiple objective integer linear programming problem , volume =

    Klein, Dieter and Hannan, Edward , opturldate =. An algorithm for the multiple objective integer linear programming problem , volume =. European Journal of Operational Research , shortjournal =. 1982 , langid =

    work page 1982

  23. [23]

    INFORMS Journal on Computing , shortjournal =

    Adelgren, Nathan and Gupte, Akshay , title =. INFORMS Journal on Computing , shortjournal =. 2022 , optdoi =

    work page 2022

  24. [24]

    European Journal of Operational Research , shortjournal =

    The problem of the optimal biobjective spanning tree , author =. European Journal of Operational Research , shortjournal =. 1998 , optissn =

    work page 1998

  25. [25]

    Journal of Global Optimization , shortjournal =

    Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem , author =. Journal of Global Optimization , shortjournal =. 1998 , publisher =

    work page 1998

  26. [26]

    INFORMS Journal on Computing , shortjournal =

    A multiobjective branch-and-bound framework: Application to the biobjective spanning tree problem , author =. INFORMS Journal on Computing , shortjournal =. 2008 , optdoi =

    work page 2008

  27. [27]

    2013 , opturl =

    Caractérisation des solutions efficaces et algorithmes d'énumération exacts pour l'optimisation multiobjectif en variables mixtes binaires , author =. 2013 , opturl =

    work page 2013

  28. [28]

    and Nielsen, Lars R

    Gadegaard, Sune L. and Nielsen, Lars R. and Ehrgott, Matthias , journal =. Bi-objective branch-and-cut algorithms based on. 2019 , publisher =

    work page 2019

  29. [29]

    INFORMS Journal on Computing , shortjournal =

    Branch-and-bound for bi-objective integer programming , author =. INFORMS Journal on Computing , shortjournal =. 2019 , optdoi =

    work page 2019

  30. [30]

    and Nielsen, Lars R

    Forget, Nicolas and Gadegaard, Sune L. and Nielsen, Lars R. , title =. European Journal of Operational Research , shortjournal =. 2022 , optdoi =

    work page 2022

  31. [31]

    , title =

    Benson, Harold P. , title =. Journal of Global Optimization , shortjournal =

    work page

  32. [32]

    and Löhne, Andreas and Rudloff, Birgit , title =

    Hamel, Andreas H. and Löhne, Andreas and Rudloff, Birgit , title =. Journal of Global Optimization , shortjournal =. 2013 , optdoi =

    work page 2013

  33. [33]

    European Journal of Operational Research , shortjournal =

    The vector linear program solver Bensolve -- notes on theoretical background , author =. European Journal of Operational Research , shortjournal =

    work page

  34. [34]

    An additive algorithm for solving linear programs with zero-one variables , opturldate =

    Balas, Egon and Glover, Fred and Zionts, Stanley , journal =. An additive algorithm for solving linear programs with zero-one variables , opturldate =. 1965 , optdoi =

    work page 1965

  35. [35]

    Sensitivity analysis for branch and bound integer programming , opturldate =

    Schrage, Linus and Wolsey, Laurence , journal =. Sensitivity analysis for branch and bound integer programming , opturldate =

    work page

  36. [36]

    , title =

    Roodman, Gary M. , title =. Naval Research Logistics Quarterly , shortjournal =

    work page

  37. [37]

    , title =

    Simmons, Donald M. , title =. Operations Research , shortjournal =. 1969 , optdoi =

    work page 1969

  38. [38]

    INFOR: Information Systems and Operational Research , shortjournal =

    Love, Robert and Wong, Jsun , title =. INFOR: Information Systems and Operational Research , shortjournal =. 1976 , publisher =

    work page 1976

  39. [39]

    and Kusiak, Andrew , year =

    Heragu, Sunderesh S. and Kusiak, Andrew , year =. Efficient models for the facility layout problem , volume =. European Journal of Operational Research , shortjournal =

    work page

  40. [40]

    Amaral, André R. S. and Letchford, Adam N. , year =. A polyhedral approach to the single row facility layout problem , volume =. Mathematical Programming , shortjournal =

    work page

  41. [41]

    Optimality and non-scalar-valued performance criteria , year =

    Zadeh, Lotfi , journal =. Optimality and non-scalar-valued performance criteria , year =

    work page

  42. [42]

    Management Science , shortjournal =

    An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs , author =. Management Science , shortjournal =. 2010 , keywords =

    work page 2010

  43. [43]

    INFORMS Journal on Computing , shortjournal =

    Przybylski, Anthony and Gandibleux, Xavier and Ehrgott, Matthias , title =. INFORMS Journal on Computing , shortjournal =. 2010 , optdoi =

    work page 2010

  44. [44]

    Computational Optimization and Applications , shortjournal =

    Borchers, Brian and Young, Joseph , title =. Computational Optimization and Applications , shortjournal =. 2007 , optdoi =

    work page 2007

  45. [45]

    and Vannelli, Anthony , title =

    Anjos, Miguel F. and Vannelli, Anthony , title =. Operations Research Proceedings 2005 , year =

    work page 2005

  46. [46]

    and Sinnl, Markus and Tricoire, Fabien , journal =

    Bökler, Fritz and Parragh, Sophie N. and Sinnl, Markus and Tricoire, Fabien , journal =. An outer approximation algorithm for generating the. 2024 , publisher =

    work page 2024

  47. [47]

    ACM Transactions on Mathematical Software , shortjournal =

    Krislock, Nathan and Malick, Jérôme and Roupin, Frédéric , title =. ACM Transactions on Mathematical Software , shortjournal =. 2017 , publisher =

    work page 2017

  48. [48]

    OR Spektrum , shortjournal =

    Three algorithms for bicriteria integer linear programs , author =. OR Spektrum , shortjournal =. 1994 , publisher =

    work page 1994

  49. [49]

    1984 , publisher =

    Multiobjective Programming and Planning , author =. 1984 , publisher =

    work page 1984

  50. [50]

    Amaral, André R. S. , year =. On the exact solution of a facility layout problem , volume =. European Journal of Operational Research , shortjournal =

    work page

  51. [51]

    , title =

    Hungerländer, Philipp and Anjos, Miguel F. , title =. Operations Research Proceedings 2012 , year =

    work page 2012

  52. [52]

    Row layout benchmarks , opturl =

    work page

  53. [53]

    Mathematical Programming Computation , shortjournal =

    Fix and bound: An efficient approach for solving large-scale quadratic programming problems with box constraints , author =. Mathematical Programming Computation , shortjournal =. 2025 , publisher =

    work page 2025

  54. [54]

    Mathematical Programming , shortjournal =

    Rendl, Franz and Rinaldi, Giovanni and Wiegele, Angelika , title =. Mathematical Programming , shortjournal =. 2010 , optdoi =

    work page 2010

  55. [55]

    and Johnson, David S

    Garey, Michael R. and Johnson, David S. and Stockmeyer, Larry J. , journal =. Some simplified. 1976 , optdoi =

    work page 1976

  56. [56]

    and Queyranne, Maurice , title =

    Picard, Jean C. and Queyranne, Maurice , title =. Operations Research , shortjournal =. 1981 , optdoi =

    work page 1981

  57. [57]

    and Negahban, Ashkan , year =

    Azadeh, Ali and Moghaddam, Mohsen and Asadzadeh, Seyed M. and Negahban, Ashkan , year =. An integrated fuzzy simulation-fuzzy data envelopment analysis algorithm for job-shop layout optimization: The case of injection process with ambiguous data , volume =. European Journal of Operational Research , shortjournal =

    work page

  58. [58]

    Electrotehnica, Electronica, Automatica , shortjournal =

    Ouhoud, Amina and Taibi, Amani and Djerbouad, Wafaa , title =. Electrotehnica, Electronica, Automatica , shortjournal =. 2025 , optdoi =

    work page 2025

  59. [59]

    and Gurusamy, Selvakumar and Dharmaraj, Vignesh K

    Lenin, Nagarajan and Mahalingam, Siva K. and Gurusamy, Selvakumar and Dharmaraj, Vignesh K. , title =. European Journal of Industrial Engineering , shortjournal =. 2018 , optdoi =

    work page 2018

  60. [60]

    and Ravindran, Siva K

    Lenin, Nagarajan and Durairaj, Siva K. and Ravindran, Siva K. and Islam, Nazrul , title =. Journal of Advanced Manufacturing Systems , shortjournal =. 2014 , optdoi =

    work page 2014

  61. [61]

    The International Journal of Advanced Manufacturing Technology , shortjournal =

    Lenin, Nagarajan and Nazrul, Islam and Durairaj, Ravindran , title =. The International Journal of Advanced Manufacturing Technology , shortjournal =. 2012 , optdoi =

    work page 2012

  62. [62]

    INFORMS Journal on Computing , shortjournal =

    Buchheim, Christoph and Wiegele, Angelika and Zheng, Lanbo , title =. INFORMS Journal on Computing , shortjournal =. 2010 , optdoi =

    work page 2010

  63. [63]

    An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , volume =

    Laumanns, Marco and Thiele, Lothar and Zitzler, Eckart , year =. An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method , volume =. European Journal of Operational Research , shortjournal =

    work page

  64. [64]

    2020 , note =

    Solution approaches for the single row facility layout problem based on semidefinite programming , author =. 2020 , note =

    work page 2020

  65. [65]

    Operations Research Proceedings 2021 , year =

    Schwiddessen, Jan , title =. Operations Research Proceedings 2021 , year =

    work page 2021

  66. [66]

    and Dächert, Kerstin and Klamroth, Kathrin and Ruzika, Stefan , title =

    Halffmann, Pascal and Schäfer, Luca E. and Dächert, Kerstin and Klamroth, Kathrin and Ruzika, Stefan , title =. Journal of Multi-Criteria Decision Analysis , shortjournal =

    work page

  67. [67]

    and Alfa, Attahiru S

    Heragu, Sunderesh S. and Alfa, Attahiru S. , year =. Experimental analysis of simulated annealing based algorithms for the layout problem , volume =. European Journal of Operational Research , shortjournal =

    work page

  68. [68]

    Fast local search for single row facility layout , volume =

    Palubeckis, Gintaras , year =. Fast local search for single row facility layout , volume =. European Journal of Operational Research , shortjournal =

    work page

  69. [69]

    Knowledge-Based Systems , shortjournal =

    Rubio-Sánchez, Manuel and Gallego, Micael and Gortázar, Francisco and Duarte, Abraham , year =. Knowledge-Based Systems , shortjournal =

    work page

  70. [70]

    Single row facility layout using multi-start simulated annealing , volume =

    Palubeckis, Gintaras , year =. Single row facility layout using multi-start simulated annealing , volume =. Computers & Industrial Engineering , shortjournal =

    work page

  71. [71]

    Teo, Y. T. and Ponnambalam, S. G. , booktitle =. A hybrid. 2008 , pages =

    work page 2008

  72. [72]

    and Kusiak, Andrew , journal =

    Heragu, Sunderesh S. and Kusiak, Andrew , journal =. Machine layout problem in flexible manufacturing systems , volume =. 1988 , optdoi =

    work page 1988

  73. [73]

    Suryanarayanan, J. K. and Golden, Bruce L. and Wang, Qiwen , year =. A new heuristic for the linear placement problem , volume =. Computers & Operations Research , shortjournal =

    work page

  74. [74]

    , pages =

    Hungerländer, Philipp and Anjos, Miguel F. , pages =. A semidefinite optimization approach to space-free multi-row facility layout , year =

    work page

  75. [75]

    A bicriteria approach to the two-machine flow shop scheduling problem , journal =

    Serpil Sayin and Selçuk Karabati , keywords =. A bicriteria approach to the two-machine flow shop scheduling problem , journal =. 1999 , optissn =

    work page 1999

  76. [76]

    ACM Transactions on Mathematical Software , xmonth = jul, articleno =

    Gusmeroli, Nicol\`. ACM Transactions on Mathematical Software , xmonth = jul, articleno =. 2022 , issue_date =

    work page 2022

  77. [77]

    Mathematical Programming , year=

    Buchheim, Christoph and Caprara, Alberto and Lodi, Andrea , title=. Mathematical Programming , year=

    work page

  78. [78]

    , title=

    Mitchell, John E. , title=. Journal of Combinatorial Optimization , year=

    work page

  79. [79]

    Mathematical Programming , year=

    Helmberg, Christoph and Rendl, Franz , title=. Mathematical Programming , year=

    work page

  80. [80]

    , title=

    Anjos, Miguel F. , title=. Mathematical Methods of Operations Research , year=

    work page

Showing first 80 references.