IDEAS home Printed from https://ideas.repec.org/f/c/pba1664.html
   My authors  Follow this author

Egon Balas

(deceased)

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. BALAS, Egon & BOCKMAYR, Alexander & PISARUK, Nicolai & WOLSEY, Laurence, 2002. "On unions and dominants of polytopes," LIDAM Discussion Papers CORE 2002008, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).

    Cited by:

    1. L. Foulds & B. Toklu & J. Wilson, 2009. "Modelling either-or relations in integer programming," Annals of Operations Research, Springer, vol. 166(1), pages 203-222, February.
    2. Ioannis Mourtos, 2016. "Cardinality constraints and systems of restricted representatives," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1061-1089, April.

  2. Balas, E. & Saltzman, M.J., 1988. "An Algorithm For The Three-Index Assignment Problem," GSIA Working Papers 88-89-23, Carnegie Mellon University, Tepper School of Business.

    Cited by:

    1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    2. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
    3. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    4. G Appa & D Magos & I Mourtos, 2004. "A Branch & Cut algorithm for a four-index assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 298-307, March.
    5. Urban, Timothy L. & Russell, Robert A., 2003. "Scheduling sports competitions on multiple venues," European Journal of Operational Research, Elsevier, vol. 148(2), pages 302-311, July.
    6. Molitor, P. & Jäger, G. & Goldengorin, B., 2005. "Some basics on tolerances," Research Report 05A13, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    7. Krokhmal, Pavlo A. & Pardalos, Panos M., 2009. "Random assignment problems," European Journal of Operational Research, Elsevier, vol. 194(1), pages 1-17, April.
    8. Huang, Gaofeng & Lim, Andrew, 2006. "A hybrid genetic algorithm for the Three-Index Assignment Problem," European Journal of Operational Research, Elsevier, vol. 172(1), pages 249-257, July.
    9. Duc Manh Nguyen & Hoai An Le Thi & Tao Pham Dinh, 2014. "Solving the Multidimensional Assignment Problem by a Cross-Entropy method," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 808-823, May.
    10. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    11. Jäger, G. & Goldengorin, B., 2005. "How to make a greedy heuristic for the asymmetric traveling salesman problem competitive," Research Report 05A11, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    12. Lev G. Afraimovich & Maxim D. Emelin, 2022. "Complexity of Solutions Combination for the Three-Index Axial Assignment Problem," Mathematics, MDPI, vol. 10(7), pages 1-10, March.
    13. Kim, Bum-Jin & Hightower, William L. & Hahn, Peter M. & Zhu, Yi-Rong & Sun, Lu, 2010. "Lower bounds for the axial three-index assignment problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 654-668, May.
    14. Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2012. "A branch-and-cut procedure for the Udine Course Timetabling problem," Annals of Operations Research, Springer, vol. 194(1), pages 71-87, April.
    15. Boštjan Gabrovšek & Tina Novak & Janez Povh & Darja Rupnik Poklukar & Janez Žerovnik, 2020. "Multiple Hungarian Method for k -Assignment Problem," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    16. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    17. Don A. Grundel & Pavlo A. Krokhmal & Carlos A. S. Oliveira & Panos M. Pardalos, 2007. "On the number of local minima for the multidimensional assignment problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 1-18, January.
    18. B. I. Goldengorin & D. S. Malyshev & P. M. Pardalos & V. A. Zamaraev, 2015. "A tolerance-based heuristic approach for the weighted independent set problem," Journal of Combinatorial Optimization, Springer, vol. 29(2), pages 433-450, February.

Articles

  1. Egon Balas, 2011. "Projecting systems of linear inequalities with binary variables," Annals of Operations Research, Springer, vol. 188(1), pages 19-31, August.

    Cited by:

  2. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.

    Cited by:

    1. Filipa D. Carvalho & Maria Teresa Almeida, 2017. "The triangle k-club problem," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 814-846, April.
    2. Moeini, Asghar., 2017. "Identification of unidentified equality constraints for integer programming problems," European Journal of Operational Research, Elsevier, vol. 260(2), pages 460-467.
    3. Taccari, Leonardo, 2016. "Integer programming formulations for the elementary shortest path problem," European Journal of Operational Research, Elsevier, vol. 252(1), pages 122-130.
    4. L. Foulds & B. Toklu & J. Wilson, 2009. "Modelling either-or relations in integer programming," Annals of Operations Research, Springer, vol. 166(1), pages 203-222, February.
    5. D. Aussel & J. J. Ye, 2008. "Quasiconvex Minimization on a Locally Finite Union of Convex Sets," Journal of Optimization Theory and Applications, Springer, vol. 139(1), pages 1-16, October.
    6. Bodur, Merve & Dash, Sanjeeb & Günlük, Oktay, 2017. "A new lift-and-project operator," European Journal of Operational Research, Elsevier, vol. 257(2), pages 420-428.
    7. Jan Kronqvist & Andreas Lundell & Tapio Westerlund, 2018. "Reformulations for utilizing separability when solving convex MINLP problems," Journal of Global Optimization, Springer, vol. 71(3), pages 571-592, July.
    8. STEPHAN, Rüdiger, 2010. "An extension of disjunctive programming and its impact for compact tree formulations," LIDAM Discussion Papers CORE 2010045, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Lee, Younsoo & Lee, Kyungsik, 2020. "Lot-sizing and scheduling in flat-panel display manufacturing process," Omega, Elsevier, vol. 93(C).
    10. Almeida, Maria Teresa & Carvalho, Filipa D., 2014. "An analytical comparison of the LP relaxations of integer models for the k-club problem," European Journal of Operational Research, Elsevier, vol. 232(3), pages 489-498.

  3. Egon Balas, 2004. "Logical Constraints as Cardinality Rules: Tight Representation," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 115-128, June.

    Cited by:

    1. Jinhak Kim & Mohit Tawarmalani & Jean-Philippe P. Richard, 2019. "Convexification of Permutation-Invariant Sets," Purdue University Economics Working Papers 1315, Purdue University, Department of Economics.

  4. Balas, Egon, 2002. "Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold Medal, July 9, 2001, Rotterdam," European Journal of Operational Research, Elsevier, vol. 141(1), pages 1-7, August.

    Cited by:

    1. Shlyk, Vladimir A., 2013. "Master corner polyhedron: Vertices," European Journal of Operational Research, Elsevier, vol. 226(2), pages 203-210.

  5. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.

    Cited by:

    1. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2013. "A new class of functions for measuring solution integrality in the Feasibility Pump approach: Complete Results," DIAG Technical Reports 2013-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    2. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2010. "New concave penalty functions for improving the Feasibility Pump," DIS Technical Reports 2010-10, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    3. Guastaroba, G. & Savelsbergh, M. & Speranza, M.G., 2017. "Adaptive Kernel Search: A heuristic for solving Mixed Integer linear Programs," European Journal of Operational Research, Elsevier, vol. 263(3), pages 789-804.
    4. Lluís-Miquel Munguía & Shabbir Ahmed & David A. Bader & George L. Nemhauser & Yufen Shao, 2018. "Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs," Computational Optimization and Applications, Springer, vol. 69(1), pages 1-24, January.
    5. Weili Zhang & Charles D. Nicholson, 2020. "Objective scaling ensemble approach for integer linear programming," Journal of Heuristics, Springer, vol. 26(1), pages 1-19, February.
    6. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2010. "Feasibility Pump-Like Heuristics for Mixed Integer Problems," DIS Technical Reports 2010-15, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    7. Saïd Hanafi & Raca Todosijević, 2017. "Mathematical programming based heuristics for the 0–1 MIP: a survey," Journal of Heuristics, Springer, vol. 23(4), pages 165-206, August.
    8. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2011. "A new class of functions for measuring solution integrality in the Feasibility Pump approach," DIS Technical Reports 2011-08, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".

  6. E. Balas, 1999. "New classes of efficiently solvable generalized Traveling Salesman Problems," Annals of Operations Research, Springer, vol. 86(0), pages 529-558, January.

    Cited by:

    1. Timo Hintsch & Stefan Irnich, 2017. "Large Multiple Neighborhood Search for the Clustered Vehicle-Routing Problem," Working Papers 1701, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    2. Christian Tilk & Stefan Irnich, 2014. "Dynamic Programming for the Minimum Tour Duration Problem," Working Papers 1408, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 04 Aug 2014.
    3. Eranda Çela & Vladimir G. Deineko & Gerhard J. Woeginger, 2017. "The multi-stripe travelling salesman problem," Annals of Operations Research, Springer, vol. 259(1), pages 21-34, December.
    4. Oleg L. Tashlykov & Alexander N. Sesekin & Alexander G. Chentsov & Alexei A. Chentsov, 2022. "Development of Methods for Route Optimization of Work in Inhomogeneous Radiation Fields to Minimize the Dose Load of Personnel," Energies, MDPI, vol. 15(13), pages 1-11, June.
    5. Nicola Secomandi & François Margot, 2009. "Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 57(1), pages 214-230, February.
    6. Vu, Duc Minh & Hewitt, Mike & Vu, Duc D., 2022. "Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery," European Journal of Operational Research, Elsevier, vol. 302(3), pages 831-846.
    7. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    8. Jeanette Schmidt & Stefan Irnich, 2020. "New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem," Working Papers 2020, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    9. Hintsch, Timo & Irnich, Stefan, 2018. "Large multiple neighborhood search for the clustered vehicle-routing problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 118-131.
    10. Andre A. Cire & Willem-Jan van Hoeve, 2013. "Multivalued Decision Diagrams for Sequencing Problems," Operations Research, INFORMS, vol. 61(6), pages 1411-1428, December.
    11. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    12. Jayanth Krishna Mogali & Joris Kinable & Stephen F. Smith & Zachary B. Rubinstein, 2021. "Scheduling for multi-robot routing with blocking and enabling constraints," Journal of Scheduling, Springer, vol. 24(3), pages 291-318, June.
    13. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    14. Christian Tilk & Stefan Irnich, 2017. "Dynamic Programming for the Minimum Tour Duration Problem," Transportation Science, INFORMS, vol. 51(2), pages 549-565, May.

  7. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.

    Cited by:

    1. Tamssaouet, Karim & Dauzère-Pérès, Stéphane, 2023. "A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 311(2), pages 455-471.
    2. Zhang, Rui & Song, Shiji & Wu, Cheng, 2013. "A hybrid artificial bee colony algorithm for the job shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 167-178.
    3. Susana Fernandes & Helena Ramalhinho-Lourenço, 2007. "A simple optimised search heuristic for the job-shop scheduling problem," Economics Working Papers 1050, Department of Economics and Business, Universitat Pompeu Fabra.
    4. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
    5. Murovec, Boštjan, 2015. "Job-shop local-search move evaluation without direct consideration of the criterion’s value," European Journal of Operational Research, Elsevier, vol. 241(2), pages 320-329.
    6. Zhang, Rui & Chang, Pei-Chann & Wu, Cheng, 2013. "A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production," International Journal of Production Economics, Elsevier, vol. 145(1), pages 38-52.
    7. Helena Ramalhinho-Lourenço & Olivier C. Martin & Thomas Stützle, 2000. "Iterated local search," Economics Working Papers 513, Department of Economics and Business, Universitat Pompeu Fabra.
    8. Paolo Detti & Carlo Meloni & Marco Pranzo, 2007. "Local search algorithms for finding the Hamiltonian completion number of line graphs," Annals of Operations Research, Springer, vol. 156(1), pages 5-24, December.
    9. Stefan Voßs & Andreas Fink & Cees Duin, 2005. "Looking Ahead with the Pilot Method," Annals of Operations Research, Springer, vol. 136(1), pages 285-302, April.
    10. Mukherjee, Saral & Chatterjee, A.K., 2006. "Applying machine based decomposition in 2-machine flow shops," European Journal of Operational Research, Elsevier, vol. 169(3), pages 723-741, March.
    11. Rossi, Andrea, 2014. "Flexible job shop scheduling with sequence-dependent setup and transportation times by ant colony with reinforced pheromone relationships," International Journal of Production Economics, Elsevier, vol. 153(C), pages 253-267.
    12. Jian Zhang & Guofu Ding & Yisheng Zou & Shengfeng Qin & Jianlin Fu, 2019. "Review of job shop scheduling research and its new perspectives under Industry 4.0," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1809-1830, April.
    13. Christoph Schuster, 2006. "No-wait Job Shop Scheduling: Tabu Search and Complexity of Subproblems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 473-491, July.
    14. Mogali, Jayanth Krishna & Barbulescu, Laura & Smith, Stephen F., 2021. "Efficient primal heuristic updates for the blocking job shop problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 82-101.
    15. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    16. Mukherjee, Saral & Chatterjee, A.K., 2007. "On the representation of the one machine sequencing problem in the shifting bottleneck heuristic," European Journal of Operational Research, Elsevier, vol. 182(1), pages 475-479, October.
    17. Bertsimas, Dimitris & Gupta, Shubham & Lulli, Guglielmo, 2014. "Dynamic resource allocation: A flexible and tractable modeling framework," European Journal of Operational Research, Elsevier, vol. 236(1), pages 14-26.
    18. T. C. E. Cheng & Bo Peng & Zhipeng Lü, 2016. "A hybrid evolutionary algorithm to solve the job shop scheduling problem," Annals of Operations Research, Springer, vol. 242(2), pages 223-237, July.
    19. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    20. Kurowski, Krzysztof & Pecyna, Tomasz & Slysz, Mateusz & Różycki, Rafał & Waligóra, Grzegorz & Wȩglarz, Jan, 2023. "Application of quantum approximate optimization algorithm to job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 518-528.
    21. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    22. Murovec, Bostjan & Suhel, Peter, 2004. "A repairing technique for the local search of the job-shop problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 220-238, February.
    23. Chong Peng & Guanglin Wu & T Warren Liao & Hedong Wang, 2019. "Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem," PLOS ONE, Public Library of Science, vol. 14(9), pages 1-19, September.
    24. Stutzle, Thomas, 2006. "Iterated local search for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1519-1539, November.
    25. Yang-Kuei Lin & Chin Soon Chong, 2017. "Fast GA-based project scheduling for computing resources allocation in a cloud manufacturing system," Journal of Intelligent Manufacturing, Springer, vol. 28(5), pages 1189-1201, June.
    26. César Rego & Fred Glover, 2010. "Ejection chain and filter-and-fan methods in combinatorial optimization," Annals of Operations Research, Springer, vol. 175(1), pages 77-105, March.
    27. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    28. Mati, Yazid & Dauzère-Pérès, Stèphane & Lahlou, Chams, 2011. "A general approach for optimizing regular criteria in the job-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 212(1), pages 33-42, July.

  8. Egon Balas & Giuseppe Lancia & Paolo Serafini & Alkiviadis Vazacopoulos, 1998. "Job Shop Scheduling With Deadlines," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 329-353, December.

    Cited by:

    1. Fan Yang & Roel Leus, 2021. "Scheduling hybrid flow shops with time windows," Journal of Heuristics, Springer, vol. 27(1), pages 133-158, April.
    2. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.

  9. Egon Balas & Sebastián Ceria & Gérard Cornuéjols, 1996. "Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework," Management Science, INFORMS, vol. 42(9), pages 1229-1246, September.

    Cited by:

    1. Jonathan Eckstein & Mikhail Nediak, 2005. "Depth-Optimized Convexity Cuts," Annals of Operations Research, Springer, vol. 139(1), pages 95-129, October.
    2. Kent Andersen & Gérard Cornuéjols & Yanjun Li, 2005. "Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts," Management Science, INFORMS, vol. 51(11), pages 1720-1732, November.
    3. G Appa & D Magos & I Mourtos, 2004. "A Branch & Cut algorithm for a four-index assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 298-307, March.
    4. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.
    5. Drexl, Andreas & Nissen, Rudiger & Patterson, James H. & Salewski, Frank, 2000. "ProGen/[pi]x - An instance generator for resource-constrained project scheduling problems with partially renewable resources and further extensions," European Journal of Operational Research, Elsevier, vol. 125(1), pages 59-72, August.
    6. Mustafa Kılınç & Jeff Linderoth & James Luedtke & Andrew Miller, 2014. "Strong-branching inequalities for convex mixed integer nonlinear programs," Computational Optimization and Applications, Springer, vol. 59(3), pages 639-665, December.
    7. Lawrence C. Leung & Yer Van Hui & Yong Wang & Gang Chen, 2009. "A 0--1 LP Model for the Integration and Consolidation of Air Cargo Shipments," Operations Research, INFORMS, vol. 57(2), pages 402-412, April.
    8. Catanzaro, Daniele & Coniglio, Stefano & Furini, Fabio, 2021. "On the exact separation of cover inequalities of maximum-depth," LIDAM Discussion Papers CORE 2021018, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    9. Gérard Cornuéjols, 2007. "Revival of the Gomory cuts in the 1990’s," Annals of Operations Research, Springer, vol. 149(1), pages 63-66, February.
    10. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation I: foundations and taxonomy," 4OR, Springer, vol. 14(1), pages 1-40, March.
    11. Jonathan H. Owen & Sanjay Mehrotra, 2002. "On the Value of Binary Expansions for General Mixed-Integer Linear Programs," Operations Research, INFORMS, vol. 50(5), pages 810-819, October.
    12. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms," 4OR, Springer, vol. 14(2), pages 107-131, June.
    13. R. Andrade & A. Lisser & N. Maculan & G. Plateau, 2005. "B&B Frameworks for the Capacity Expansion of High Speed Telecommunication Networks Under Uncertainty," Annals of Operations Research, Springer, vol. 140(1), pages 49-65, November.
    14. Escudero, L. F. & Munoz, S., 1998. "On characterizing tighter formulations for 0-1 programs," European Journal of Operational Research, Elsevier, vol. 106(1), pages 172-176, April.
    15. André R. S. Amaral, 2008. "An Exact Approach to the One-Dimensional Facility Layout Problem," Operations Research, INFORMS, vol. 56(4), pages 1026-1033, August.
    16. Lewis Ntaimo, 2010. "Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse," Operations Research, INFORMS, vol. 58(1), pages 229-243, February.
    17. Adam N. Letchford, 2001. "On Disjunctive Cuts for Combinatorial Optimization," Journal of Combinatorial Optimization, Springer, vol. 5(3), pages 299-315, September.
    18. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.
    19. Sebastián Ceria, 2007. "A brief history of lift-and-project," Annals of Operations Research, Springer, vol. 149(1), pages 57-61, February.
    20. Pereira, Dilson Lucas & Salles da Cunha, Alexandre, 2020. "Dynamic intersection of multiple implicit Dantzig–Wolfe decompositions applied to the adjacent only quadratic minimum spanning tree problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 413-426.
    21. Quoc Trung Bui & Yves Deville & Quang Dung Pham, 2016. "Exact methods for solving the elementary shortest and longest path problems," Annals of Operations Research, Springer, vol. 244(2), pages 313-348, September.
    22. Wesselmann, Franz & Koberstein, Achim & Suhl, Uwe H., 2011. "Pivot-and-reduce cuts: An approach for improving Gomory mixed-integer cuts," European Journal of Operational Research, Elsevier, vol. 214(1), pages 15-26, October.
    23. Hugues Marchand & Laurence A. Wolsey, 2001. "Aggregation and Mixed Integer Rounding to Solve MIPs," Operations Research, INFORMS, vol. 49(3), pages 363-371, June.
    24. Alves, Maria Joao & Climaco, Joao, 1999. "Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems," European Journal of Operational Research, Elsevier, vol. 117(3), pages 565-577, September.
    25. Caroe, Claus C. & Tind, Jorgen, 1997. "A cutting-plane approach to mixed 0-1 stochastic integer programs," European Journal of Operational Research, Elsevier, vol. 101(2), pages 306-316, September.
    26. Saez, Jesus, 2000. "Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes," European Journal of Operational Research, Elsevier, vol. 121(3), pages 609-626, March.

  10. Egon Balas & Maria C. Carrera, 1996. "A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering," Operations Research, INFORMS, vol. 44(6), pages 875-890, December.

    Cited by:

    1. Siddhartha Syam & Bala Shetty, 1998. "Coordinated replenishments from multiple suppliers with price discounts," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 579-598, September.
    2. Gao, Chao & Yao, Xin & Weise, Thomas & Li, Jinlong, 2015. "An efficient local search heuristic with row weighting for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 246(3), pages 750-761.
    3. Boschetti, Marco A. & Golfarelli, Matteo & Graziani, Simone, 2020. "An exact method for shrinking pivot tables," Omega, Elsevier, vol. 93(C).
    4. Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
    5. José García & Gino Astorga & Víctor Yepes, 2021. "An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics," Mathematics, MDPI, vol. 9(3), pages 1-20, January.
    6. Jihong Yan & Wenliang Cheng & Chengyu Wang & Jun Liu & Ming Gao & Aoying Zhou, 2015. "Optimizing word set coverage for multi-event summarization," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 996-1015, November.
    7. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    8. Hernández-Leandro, Noberto A. & Boyer, Vincent & Salazar-Aguilar, M. Angélica & Rousseau, Louis-Martin, 2019. "A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem," European Journal of Operational Research, Elsevier, vol. 272(3), pages 859-867.
    9. Kedong Yan & Dongjing Miao & Cui Guo & Chanying Huang, 2021. "Efficient feature selection for logical analysis of large-scale multi-class datasets," Journal of Combinatorial Optimization, Springer, vol. 42(1), pages 1-23, July.
    10. Victor Reyes & Ignacio Araya, 2021. "A GRASP-based scheme for the set covering problem," Operational Research, Springer, vol. 21(4), pages 2391-2408, December.
    11. Peeters, Marc & Degraeve, Zeger, 2006. "An linear programming based lower bound for the simple assembly line balancing problem," European Journal of Operational Research, Elsevier, vol. 168(3), pages 716-731, February.
    12. Yagiura, Mutsunori & Kishida, Masahiro & Ibaraki, Toshihide, 2006. "A 3-flip neighborhood local search for the set covering problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 472-499, July.
    13. Noriyoshi Sukegawa & Yoshitsugu Yamamoto & Liyuan Zhang, 2013. "Lagrangian relaxation and pegging test for the clique partitioning problem," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 7(4), pages 363-391, December.
    14. Wang, Yiyuan & Pan, Shiwei & Al-Shihabi, Sameh & Zhou, Junping & Yang, Nan & Yin, Minghao, 2021. "An improved configuration checking-based algorithm for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 294(2), pages 476-491.
    15. Ablanedo-Rosas, José H. & Rego, César, 2010. "Surrogate constraint normalization for the set covering problem," European Journal of Operational Research, Elsevier, vol. 205(3), pages 540-551, September.
    16. Ibrahim, Walid & El-Sayed, Hesham & El-Chouemie, Amr & Amer, Hoda, 2009. "An adaptive heuristic algorithm for VLSI test vectors selection," European Journal of Operational Research, Elsevier, vol. 199(3), pages 630-639, December.
    17. Alberto Caprara & Matteo Fischetti & Paolo Toth, 1999. "A Heuristic Method for the Set Covering Problem," Operations Research, INFORMS, vol. 47(5), pages 730-743, October.
    18. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    19. Youngho Lee & Hanif D. Sherali & Ikhyun Kwon & Seongin Kim, 2006. "A new reformulation approach for the generalized partial covering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(2), pages 170-179, March.
    20. Ran Wei & Alan Murray & Rajan Batta, 2014. "A bounding-based solution approach for the continuous arc covering problem," Journal of Geographical Systems, Springer, vol. 16(2), pages 161-182, April.
    21. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.

  11. Egon Balas & Jan Karel Lenstra & Alkis Vazacopoulos, 1995. "The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling," Management Science, INFORMS, vol. 41(1), pages 94-109, January.

    Cited by:

    1. C N Potts & J D Whitehead, 2007. "Heuristics for a coupled-operation scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(10), pages 1375-1388, October.
    2. Egon Balas & Giuseppe Lancia & Paolo Serafini & Alkiviadis Vazacopoulos, 1998. "Job Shop Scheduling With Deadlines," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 329-353, December.
    3. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    4. Yiyo Kuo & Sheng-I Chen & Yen-Hung Yeh, 2020. "Single machine scheduling with sequence-dependent setup times and delayed precedence constraints," Operational Research, Springer, vol. 20(2), pages 927-942, June.
    5. Mukherjee, Saral & Chatterjee, A.K., 2006. "Applying machine based decomposition in 2-machine flow shops," European Journal of Operational Research, Elsevier, vol. 169(3), pages 723-741, March.
    6. Zoghby, Jeriad & Wesley Barnes, J. & Hasenbein, John J., 2005. "Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches," European Journal of Operational Research, Elsevier, vol. 167(2), pages 336-348, December.
    7. Michael Pinedo & Marcos Singer, 1999. "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 1-17, February.
    8. Zijm, W. H. M. & Buitenhek, R., 1996. "Capacity planning and lead time management," International Journal of Production Economics, Elsevier, vol. 46(1), pages 165-179, December.
    9. Marc R. Lambrecht & Philip L. Ivens & Nico J. Vandaele, 1998. "ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling," Management Science, INFORMS, vol. 44(11-Part-1), pages 1548-1561, November.
    10. El-Bouri, A. & Azizi, N. & Zolfaghari, S., 2007. "A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1894-1910, March.
    11. Mukherjee, Saral & Chatterjee, A.K., 2007. "On the representation of the one machine sequencing problem in the shifting bottleneck heuristic," European Journal of Operational Research, Elsevier, vol. 182(1), pages 475-479, October.
    12. Sheen, Gwo-Ji & Liao, Lu-Wen, 2007. "A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags," European Journal of Operational Research, Elsevier, vol. 181(1), pages 102-116, August.
    13. Braune, R. & Zäpfel, G. & Affenzeller, M., 2012. "An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 218(1), pages 76-85.
    14. Murat Güngör, 2023. "A note on the shifting bottleneck procedure for job shop scheduling," Journal of Scheduling, Springer, vol. 26(4), pages 399-402, August.
    15. Mukherjee, Saral & Chatterjee Ashis K, 2002. "Applying Machine Based Decomposition in 2-Machine Flow Shops," IIMA Working Papers WP2002-08-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    17. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.

  12. Egon Balas & Matthew J. Saltzman, 1991. "An Algorithm for the Three-Index Assignment Problem," Operations Research, INFORMS, vol. 39(1), pages 150-161, February.
    See citations under working paper version above.
  13. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.

    Cited by:

    1. Yuanfei Wei & Zalinda Othman & Kauthar Mohd Daud & Shihong Yin & Qifang Luo & Yongquan Zhou, 2022. "Equilibrium Optimizer and Slime Mould Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem," Mathematics, MDPI, vol. 10(21), pages 1-20, November.
    2. Tarantilis, C. D. & Kiranoudis, C. T., 2002. "A list-based threshold accepting method for job shop scheduling problems," International Journal of Production Economics, Elsevier, vol. 77(2), pages 159-171, May.
    3. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    4. Susana Fernandes & Helena Ramalhinho-Lourenço, 2007. "A simple optimised search heuristic for the job-shop scheduling problem," Economics Working Papers 1050, Department of Economics and Business, Universitat Pompeu Fabra.
    5. Guinet, Alain, 2000. "Efficiency of reductions of job-shop to flow-shop problems," European Journal of Operational Research, Elsevier, vol. 125(3), pages 469-485, September.
    6. Bierwirth, C. & Kuhpfahl, J., 2017. "Extended GRASP for the job shop scheduling problem with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 261(3), pages 835-848.
    7. Murovec, Boštjan, 2015. "Job-shop local-search move evaluation without direct consideration of the criterion’s value," European Journal of Operational Research, Elsevier, vol. 241(2), pages 320-329.
    8. Mascis, Alessandro & Pacciarelli, Dario, 2002. "Job-shop scheduling with blocking and no-wait constraints," European Journal of Operational Research, Elsevier, vol. 143(3), pages 498-517, December.
    9. Seyed Mahdi Homayouni & Dalila B. M. M. Fontes, 2021. "Production and transport scheduling in flexible job shop manufacturing systems," Journal of Global Optimization, Springer, vol. 79(2), pages 463-502, February.
    10. Drótos, Márton & Erdos, Gábor & Kis, Tamás, 2009. "Computing lower and upper bounds for a large-scale industrial job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 197(1), pages 296-306, August.
    11. Ansis Ozolins, 2020. "Bounded dynamic programming algorithm for the job shop problem with sequence dependent setup times," Operational Research, Springer, vol. 20(3), pages 1701-1728, September.
    12. Mohammad Mahdi Ahmadian & Amir Salehipour, 2021. "The just-in-time job-shop scheduling problem with distinct due-dates for operations," Journal of Heuristics, Springer, vol. 27(1), pages 175-204, April.
    13. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    14. Ramesh Bollapragada & Norman M. Sadeh, 2004. "Proactive release procedures for just‐in‐time job shop environments, subject to machine failures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(7), pages 1018-1044, October.
    15. Ying Sun & Jeng-Shyang Pan & Pei Hu & Shu-Chuan Chu, 2023. "Enhanced Equilibrium Optimizer algorithm applied in job shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 34(4), pages 1639-1665, April.
    16. V. Jorge Leon & S. David Wu, 1992. "On scheduling with ready‐times, due‐dates and vacations," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(1), pages 53-65, February.
    17. Egon Balas & Giuseppe Lancia & Paolo Serafini & Alkiviadis Vazacopoulos, 1998. "Job Shop Scheduling With Deadlines," Journal of Combinatorial Optimization, Springer, vol. 1(4), pages 329-353, December.
    18. Andrzej Bożek, 2020. "Energy Cost-Efficient Task Positioning in Manufacturing Systems," Energies, MDPI, vol. 13(19), pages 1-21, September.
    19. Demirkol, Ebru & Mehta, Sanjay & Uzsoy, Reha, 1998. "Benchmarks for shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 109(1), pages 137-141, August.
    20. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    21. Moursli, O. & Pochet, Y., 2000. "A branch-and-bound algorithm for the hybrid flowshop," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 113-125, March.
    22. Sabuncuoglu, Ihsan & Gurgun, Burckaan, 1996. "A neural network model for scheduling problems," European Journal of Operational Research, Elsevier, vol. 93(2), pages 288-299, September.
    23. Artigues, Christian & Billaut, Jean-Charles & Esswein, Carl, 2005. "Maximization of solution flexibility for robust shop scheduling," European Journal of Operational Research, Elsevier, vol. 165(2), pages 314-328, September.
    24. Mattfeld, Dirk C. & Bierwirth, Christian, 2004. "An efficient genetic algorithm for job shop scheduling with tardiness objectives," European Journal of Operational Research, Elsevier, vol. 155(3), pages 616-630, June.
    25. Monch, Lars & Schabacker, Rene & Pabst, Detlef & Fowler, John W., 2007. "Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2100-2118, March.
    26. Zhang, Rui & Chang, Pei-Chann & Wu, Cheng, 2013. "A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production," International Journal of Production Economics, Elsevier, vol. 145(1), pages 38-52.
    27. Gromicho, J.A.S. & Hoorn, J.J. van & Timmer, G.T., 2009. "Exponentially better than brute force: solving the jobshop scheduling problem optimally by dynamic programming," Serie Research Memoranda 0056, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    28. Goncalves, Jose Fernando & de Magalhaes Mendes, Jorge Jose & Resende, Mauricio G. C., 2005. "A hybrid genetic algorithm for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 167(1), pages 77-95, November.
    29. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    30. Hamed Piroozfard & Kuan Yew Wong & Adnan Hassan, 2016. "A Hybrid Genetic Algorithm with a Knowledge-Based Operator for Solving the Job Shop Scheduling Problems," Journal of Optimization, Hindawi, vol. 2016, pages 1-13, April.
    31. Wenda Zhang & Jason J. Sauppe & Sheldon H. Jacobson, 2021. "An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1091-1102, July.
    32. Bryan A. Norman & James C. Bean, 1999. "A genetic algorithm methodology for complex scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(2), pages 199-211, March.
    33. Da Col, Giacomo & Teppan, Erich C., 2022. "Industrial-size job shop scheduling with constraint programming," Operations Research Perspectives, Elsevier, vol. 9(C).
    34. Z C Zhu & K M Ng & H L Ong, 2010. "A modified tabu search algorithm for cost-based job shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 611-619, April.
    35. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    36. Raja Awais Liaqait & Shermeen Hamid & Salman Sagheer Warsi & Azfar Khalid, 2021. "A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0," Sustainability, MDPI, vol. 13(14), pages 1-19, July.
    37. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," Transportation Science, INFORMS, vol. 39(1), pages 104-118, February.
    38. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    39. Lourenco, Helena Ramalhinho, 1995. "Job-shop scheduling: Computational study of local search and large-step optimization methods," European Journal of Operational Research, Elsevier, vol. 83(2), pages 347-364, June.
    40. Mukherjee, Saral & Chatterjee, A.K., 2006. "Applying machine based decomposition in 2-machine flow shops," European Journal of Operational Research, Elsevier, vol. 169(3), pages 723-741, March.
    41. Zoghby, Jeriad & Wesley Barnes, J. & Hasenbein, John J., 2005. "Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches," European Journal of Operational Research, Elsevier, vol. 167(2), pages 336-348, December.
    42. Michael Pinedo & Marcos Singer, 1999. "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 1-17, February.
    43. Raúl Mencía & Carlos Mencía, 2021. "One-Machine Scheduling with Time-Dependent Capacity via Efficient Memetic Algorithms," Mathematics, MDPI, vol. 9(23), pages 1-24, November.
    44. Khayat, Ghada El & Langevin, Andre & Riopel, Diane, 2006. "Integrated production and material handling scheduling using mathematical programming and constraint programming," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1818-1832, December.
    45. J. G. Dai & Gideon Weiss, 2002. "A Fluid Heuristic for Minimizing Makespan in Job Shops," Operations Research, INFORMS, vol. 50(4), pages 692-707, August.
    46. Joao António Noivo & Helena Ramalhinho-Lourenço, 1998. "Solving two production scheduling problems with sequence-dependent set-up times," Economics Working Papers 338, Department of Economics and Business, Universitat Pompeu Fabra.
    47. Jian Zhang & Guofu Ding & Yisheng Zou & Shengfeng Qin & Jianlin Fu, 2019. "Review of job shop scheduling research and its new perspectives under Industry 4.0," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1809-1830, April.
    48. D'Amours, Sophie & Montreuil, Benoit & Soumis, Francois, 1997. "Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks," European Journal of Operational Research, Elsevier, vol. 96(1), pages 148-166, January.
    49. Taudes, Alfred & Trcka, Michael & Lukanowicz, Martin, 2002. "Organizational learning in production networks," Journal of Economic Behavior & Organization, Elsevier, vol. 47(2), pages 141-163, February.
    50. D J Stewardson & R I Whitfield, 2004. "A demonstration of the utility of fractional experimental design for finding optimal genetic algorithm parameter settings," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 132-138, February.
    51. Mallor, Fermin & Guardiola, Ivan G., 2014. "The Weibull scheduling index for client driven manufacturing processes," International Journal of Production Economics, Elsevier, vol. 150(C), pages 225-238.
    52. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    53. Ivens, Philip & Lambrecht, Marc, 1996. "Extending the shifting bottleneck procedure to real-life applications," European Journal of Operational Research, Elsevier, vol. 90(2), pages 252-268, April.
    54. Chen, Haoxun & Luh, Peter B., 2003. "An alternative framework to Lagrangian relaxation approach for job shop scheduling," European Journal of Operational Research, Elsevier, vol. 149(3), pages 499-512, September.
    55. Verena Schmid & Karl F. Doerner, 2014. "Examination and Operating Room Scheduling Including Optimization of Intrahospital Routing," Transportation Science, INFORMS, vol. 48(1), pages 59-77, February.
    56. Liaw, Ching-Fang, 2000. "A hybrid genetic algorithm for the open shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 124(1), pages 28-42, July.
    57. Michael, Elad & Wood, Tony A. & Manzie, Chris & Shames, Iman, 2022. "Sensitivity analysis for bottleneck assignment problems," European Journal of Operational Research, Elsevier, vol. 303(1), pages 159-167.
    58. Mantel, Ronald J. & Landeweerd, Henri R. A., 1995. "Design and operational control of an AGV system," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 257-266, October.
    59. Mogali, Jayanth Krishna & Barbulescu, Laura & Smith, Stephen F., 2021. "Efficient primal heuristic updates for the blocking job shop problem," European Journal of Operational Research, Elsevier, vol. 295(1), pages 82-101.
    60. Pezzella, Ferdinando & Merelli, Emanuela, 2000. "A tabu search method guided by shifting bottleneck for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 297-310, January.
    61. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    62. Aytug, Haldun & Lawley, Mark A. & McKay, Kenneth & Mohan, Shantha & Uzsoy, Reha, 2005. "Executing production schedules in the face of uncertainties: A review and some future directions," European Journal of Operational Research, Elsevier, vol. 161(1), pages 86-110, February.
    63. Zijm, W. H. M. & Buitenhek, R., 1996. "Capacity planning and lead time management," International Journal of Production Economics, Elsevier, vol. 46(1), pages 165-179, December.
    64. Pongcharoen, P. & Hicks, C. & Braiden, P. M. & Stewardson, D. J., 2002. "Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products," International Journal of Production Economics, Elsevier, vol. 78(3), pages 311-322, August.
    65. Dauzere-Peres, Stephane, 1995. "A procedure for the one-machine sequencing problem with dependent jobs," European Journal of Operational Research, Elsevier, vol. 81(3), pages 579-589, March.
    66. Amaral Armentano, Vinicius & Rigao Scrich, Cintia, 2000. "Tabu search for minimizing total tardiness in a job shop," International Journal of Production Economics, Elsevier, vol. 63(2), pages 131-140, January.
    67. Geiger, Martin Josef, 2010. "On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification," European Journal of Operational Research, Elsevier, vol. 207(3), pages 1235-1243, December.
    68. Mehdi Mrad & Anis Gharbi & Mohamed Haouari & Mohamed Kharbeche, 2016. "An optimization-based heuristic for the machine reassignment problem," Annals of Operations Research, Springer, vol. 242(1), pages 115-132, July.
    69. Lochtefeld, Darrell F. & Ciarallo, Frank W., 2015. "Multi-objectivization Via Decomposition: An analysis of helper-objectives and complete decomposition," European Journal of Operational Research, Elsevier, vol. 243(2), pages 395-404.
    70. Golenko-Ginzburg, Dimitri & Kesler, Shmuel & Landsman, Zinoviy, 1995. "Industrial job-shop scheduling with random operations and different priorities," International Journal of Production Economics, Elsevier, vol. 40(2-3), pages 185-195, August.
    71. Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "A tabu search approach to machine scheduling," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 277-300, April.
    72. S. David Wu & Eui-Seok Byeon & Robert H. Storer, 1999. "A Graph-Theoretic Decomposition of the Job Shop Scheduling Problem to Achieve Scheduling Robustness," Operations Research, INFORMS, vol. 47(1), pages 113-124, February.
    73. Marc R. Lambrecht & Philip L. Ivens & Nico J. Vandaele, 1998. "ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling," Management Science, INFORMS, vol. 44(11-Part-1), pages 1548-1561, November.
    74. João M. R. C. Fernandes & Seyed Mahdi Homayouni & Dalila B. M. M. Fontes, 2022. "Energy-Efficient Scheduling in Job Shop Manufacturing Systems: A Literature Review," Sustainability, MDPI, vol. 14(10), pages 1-34, May.
    75. Mariano Frutos & Ana Olivera & Fernando Tohmé, 2010. "A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem," Annals of Operations Research, Springer, vol. 181(1), pages 745-765, December.
    76. El-Bouri, A. & Azizi, N. & Zolfaghari, S., 2007. "A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1894-1910, March.
    77. Aardal, K. & van Hoesel, C.P.M. & Lenstra, J.K. & Stougie, L., 1997. "A decade of combinatorial optimization," Research Memorandum 023, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    78. Müller, David & Müller, Marcus G. & Kress, Dominik & Pesch, Erwin, 2022. "An algorithm selection approach for the flexible job shop scheduling problem: Choosing constraint programming solvers through machine learning," European Journal of Operational Research, Elsevier, vol. 302(3), pages 874-891.
    79. Kalir, Adar A. & Sarin, Subhash C., 2001. "A near-optimal heuristic for the sequencing problem in multiple-batch flow-shops with small equal sublots," Omega, Elsevier, vol. 29(6), pages 577-584, December.
    80. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    81. Mukherjee, Saral & Chatterjee, A.K., 2007. "On the representation of the one machine sequencing problem in the shifting bottleneck heuristic," European Journal of Operational Research, Elsevier, vol. 182(1), pages 475-479, October.
    82. Andrea D’Ariano & Marco Pranzo, 2009. "An Advanced Real-Time Train Dispatching System for Minimizing the Propagation of Delays in a Dispatching Area Under Severe Disturbances," Networks and Spatial Economics, Springer, vol. 9(1), pages 63-84, March.
    83. Frederix, Florent, 2001. "An extended enterprise planning methodology for the discrete manufacturing industry," European Journal of Operational Research, Elsevier, vol. 129(2), pages 317-325, March.
    84. Ramudhin, Amar & Marier, Philippe, 1996. "The generalized Shifting Bottleneck Procedure," European Journal of Operational Research, Elsevier, vol. 93(1), pages 34-48, August.
    85. Ganesan, Viswanath Kumar & Sivakumar, Appa Iyer, 2006. "Scheduling in static jobshops for minimizing mean flowtime subject to minimum total deviation of job completion times," International Journal of Production Economics, Elsevier, vol. 103(2), pages 633-647, October.
    86. Meloni, Carlo & Pranzo, Marco & Samà, Marcella, 2022. "Evaluation of VaR and CVaR for the makespan in interval valued blocking job shops," International Journal of Production Economics, Elsevier, vol. 247(C).
    87. Bertsimas, Dimitris & Gupta, Shubham & Lulli, Guglielmo, 2014. "Dynamic resource allocation: A flexible and tractable modeling framework," European Journal of Operational Research, Elsevier, vol. 236(1), pages 14-26.
    88. T. C. E. Cheng & Bo Peng & Zhipeng Lü, 2016. "A hybrid evolutionary algorithm to solve the job shop scheduling problem," Annals of Operations Research, Springer, vol. 242(2), pages 223-237, July.
    89. Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
    90. Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
    91. P Corry & E Kozan, 2004. "Job scheduling with technical constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 160-169, February.
    92. Herroelen, Willy & Leus, Roel, 2005. "Project scheduling under uncertainty: Survey and research potentials," European Journal of Operational Research, Elsevier, vol. 165(2), pages 289-306, September.
    93. Sourd, Francis, 2005. "Optimal timing of a sequence of tasks with general completion costs," European Journal of Operational Research, Elsevier, vol. 165(1), pages 82-96, August.
    94. Jelke J. Hoorn, 2018. "The Current state of bounds on benchmark instances of the job-shop scheduling problem," Journal of Scheduling, Springer, vol. 21(1), pages 127-128, February.
    95. I. Ece Içyüz & Jean-Philippe P. Richard & Erdem Eskigun & Dharma Acharya, 2016. "A Two-Model Solution Approach for the Monthly Coal Train Reservations Planning Problem," Transportation Science, INFORMS, vol. 50(3), pages 926-946, August.
    96. Sheen, Gwo-Ji & Liao, Lu-Wen, 2007. "A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags," European Journal of Operational Research, Elsevier, vol. 181(1), pages 102-116, August.
    97. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    98. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    99. Ahmed Kouider & Hacène Ait Haddadène & Samia Ourari & Ammar Oulamara, 2017. "Mixed graph colouring for unit-time scheduling," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1720-1729, March.
    100. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    101. Braune, R. & Zäpfel, G. & Affenzeller, M., 2012. "An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 218(1), pages 76-85.
    102. Kurowski, Krzysztof & Pecyna, Tomasz & Slysz, Mateusz & Różycki, Rafał & Waligóra, Grzegorz & Wȩglarz, Jan, 2023. "Application of quantum approximate optimization algorithm to job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 310(2), pages 518-528.
    103. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    104. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    105. Gregory A. Kasapidis & Dimitris C. Paraskevopoulos & Panagiotis P. Repoussis & Christos D. Tarantilis, 2021. "Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4044-4068, November.
    106. Penn, Michal & Raviv, Tal, 2009. "An algorithm for the maximum revenue jobshop problem," European Journal of Operational Research, Elsevier, vol. 193(2), pages 437-450, March.
    107. Murat Güngör, 2023. "A note on the shifting bottleneck procedure for job shop scheduling," Journal of Scheduling, Springer, vol. 26(4), pages 399-402, August.
    108. Reinhard Bürgy & Heinz Gröflin, 2013. "Optimal job insertion in the no-wait job shop," Journal of Combinatorial Optimization, Springer, vol. 26(2), pages 345-371, August.
    109. Shahed Mahmud & Ripon K. Chakrabortty & Alireza Abbasi & Michael J. Ryan, 2022. "Switching strategy-based hybrid evolutionary algorithms for job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 33(7), pages 1939-1966, October.
    110. Torabi, S.A. & Karimi, B. & Fatemi Ghomi, S.M.T., 2005. "The common cycle economic lot scheduling in flexible job shops: The finite horizon case," International Journal of Production Economics, Elsevier, vol. 97(1), pages 52-65, July.
    111. César Rego & Fred Glover, 2010. "Ejection chain and filter-and-fan methods in combinatorial optimization," Annals of Operations Research, Springer, vol. 175(1), pages 77-105, March.
    112. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
    113. Mukherjee, Saral & Chatterjee Ashis K, 2002. "Applying Machine Based Decomposition in 2-Machine Flow Shops," IIMA Working Papers WP2002-08-05, Indian Institute of Management Ahmedabad, Research and Publication Department.
    114. Ouenniche, J. & Bertrand, J. W. M., 2001. "The finite horizon economic lot sizing problem in job shops: : the multiple cycle approach," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 49-61, December.
    115. Ramalhinho Lourenco, Helena, 1996. "Sevast'yanov's algorithm for the flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 176-189, May.
    116. Sándor Szabó & Bogdán Zaválnij, 2022. "Clique Search in Graphs of Special Class and Job Shop Scheduling," Mathematics, MDPI, vol. 10(5), pages 1-22, February.
    117. Andy Ham, 2020. "Transfer-robot task scheduling in flexible job shop," Journal of Intelligent Manufacturing, Springer, vol. 31(7), pages 1783-1793, October.
    118. Nicholas G. Hall & Marc E. Posner, 2007. "Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures," Operations Research, INFORMS, vol. 55(4), pages 703-716, August.
    119. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    120. Chung, Daeyoung & Lee, Kichang & Shin, Kitae & Park, Jinwoo, 2005. "A new approach to job shop scheduling problems with due date constraints considering operation subcontracts," International Journal of Production Economics, Elsevier, vol. 98(2), pages 238-250, November.
    121. Vilcot, Geoffrey & Billaut, Jean-Charles, 2008. "A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 190(2), pages 398-411, October.
    122. Pannee Suanpang & Pitchaya Jamjuntr & Kittisak Jermsittiparsert & Phuripoj Kaewyong, 2022. "Tourism Service Scheduling in Smart City Based on Hybrid Genetic Algorithm Simulated Annealing Algorithm," Sustainability, MDPI, vol. 14(23), pages 1-21, December.
    123. Schutten, J. M. J. & Leussink, R. A. M., 1996. "Parallel machine scheduling with release dates, due dates and family setup times," International Journal of Production Economics, Elsevier, vol. 46(1), pages 119-125, December.
    124. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    125. Marco Pranzo & Dario Pacciarelli, 2016. "An iterated greedy metaheuristic for the blocking job shop scheduling problem," Journal of Heuristics, Springer, vol. 22(4), pages 587-611, August.
    126. Arash Amirteimoori & Reza Kia, 2023. "Concurrent scheduling of jobs and AGVs in a flexible job shop system: a parallel hybrid PSO-GA meta-heuristic," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 727-753, September.
    127. Kis, Tamas, 2003. "Job-shop scheduling with processing alternatives," European Journal of Operational Research, Elsevier, vol. 151(2), pages 307-332, December.
    128. Yiyi Xu & M’hammed Sahnoun & Fouad Ben Abdelaziz & David Baudry, 2022. "A simulated multi-objective model for flexible job shop transportation scheduling," Annals of Operations Research, Springer, vol. 311(2), pages 899-920, April.
    129. Giuseppe Lancia & Franca Rinaldi & Paolo Serafini, 2011. "A time-indexed LP-based approach for min-sum job-shop problems," Annals of Operations Research, Springer, vol. 186(1), pages 175-198, June.
    130. Christian Artigues & Dominique Feillet, 2008. "A branch and bound method for the job-shop problem with sequence-dependent setup times," Annals of Operations Research, Springer, vol. 159(1), pages 135-159, March.
    131. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.
    132. Jens Heger & Jürgen Branke & Torsten Hildebrandt & Bernd Scholz-Reiter, 2016. "Dynamic adjustment of dispatching rule parameters in flow shops with sequence-dependent set-up times," International Journal of Production Research, Taylor & Francis Journals, vol. 54(22), pages 6812-6824, November.
    133. Dauzère-Pérès, Stéphane & Ding, Junwen & Shen, Liji & Tamssaouet, Karim, 2024. "The flexible job shop scheduling problem: A review," European Journal of Operational Research, Elsevier, vol. 314(2), pages 409-432.
    134. Stephan Kreipl & Jörg Dickersbach, 2008. "Scheduling coordination problems in supply chain planning," Annals of Operations Research, Springer, vol. 161(1), pages 103-122, July.
    135. J. Essen & Johann Hurink & Woutske Hartholt & Bernd Akker, 2012. "Decision support system for the operating room rescheduling problem," Health Care Management Science, Springer, vol. 15(4), pages 355-372, December.
    136. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    137. Gonzalo Mejía & Carlos Montoya, 2010. "Applications of resource assignment and scheduling with Petri Nets and heuristic search," Annals of Operations Research, Springer, vol. 181(1), pages 795-812, December.
    138. Hoksung Yau & Leyuan Shi, 2009. "Nested partitions for the large-scale extended job shop scheduling problem," Annals of Operations Research, Springer, vol. 168(1), pages 23-39, April.
    139. Thomas G. Yeung & Scott J. Mason, 2006. "Using real options analysis to value reoptimization options in the shifting bottleneck heuristic," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 285-297, June.
    140. Yabo Luo, 2017. "Nested optimization method combining complex method and ant colony optimization to solve JSSP with complex associated processes," Journal of Intelligent Manufacturing, Springer, vol. 28(8), pages 1801-1815, December.
    141. Thomas, Andre & Charpentier, Patrick, 2005. "Reducing simulation models for scheduling manufacturing facilities," European Journal of Operational Research, Elsevier, vol. 161(1), pages 111-125, February.

  14. Balas, Egon & Jeroslow, Robert G., 1980. "Strengthening cuts for mixed integer programs," European Journal of Operational Research, Elsevier, vol. 4(4), pages 224-234, April.

    Cited by:

    1. Jonathan Eckstein & Mikhail Nediak, 2005. "Depth-Optimized Convexity Cuts," Annals of Operations Research, Springer, vol. 139(1), pages 95-129, October.
    2. Kent Andersen & Gérard Cornuéjols & Yanjun Li, 2005. "Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts," Management Science, INFORMS, vol. 51(11), pages 1720-1732, November.
    3. Egon Balas & Thiago Serra, 2020. "When Lift-and-Project Cuts Are Different," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 822-834, July.
    4. Mustafa Kılınç & Jeff Linderoth & James Luedtke & Andrew Miller, 2014. "Strong-branching inequalities for convex mixed integer nonlinear programs," Computational Optimization and Applications, Springer, vol. 59(3), pages 639-665, December.
    5. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation I: foundations and taxonomy," 4OR, Springer, vol. 14(1), pages 1-40, March.
    6. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms," 4OR, Springer, vol. 14(2), pages 107-131, June.
    7. Adam N. Letchford, 2001. "On Disjunctive Cuts for Combinatorial Optimization," Journal of Combinatorial Optimization, Springer, vol. 5(3), pages 299-315, September.
    8. Egon Balas, 2005. "Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 125-161, November.
    9. Sebastián Ceria, 2007. "A brief history of lift-and-project," Annals of Operations Research, Springer, vol. 149(1), pages 57-61, February.
    10. Michele Conforti & Gérard Cornuéjols & Giacomo Zambelli, 2011. "A Geometric Perspective on Lifting," Operations Research, INFORMS, vol. 59(3), pages 569-577, June.

  15. Egon Balas & Clarence H. Martin, 1980. "Pivot and Complement--A Heuristic for 0-1 Programming," Management Science, INFORMS, vol. 26(1), pages 86-96, January.

    Cited by:

    1. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2013. "A new class of functions for measuring solution integrality in the Feasibility Pump approach: Complete Results," DIAG Technical Reports 2013-05, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    2. Cattrysse, D. G. & van Wassenhove, L. N., 1990. "A Survey Of Algorithms For The Generalized Assignment Problem," Econometric Institute Archives 272389, Erasmus University Rotterdam.
    3. Hill, Raymond R. & Reilly, Charles H., 2000. "Multivariate composite distributions for coefficients in synthetic optimization problems," European Journal of Operational Research, Elsevier, vol. 121(1), pages 64-77, February.
    4. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2010. "New concave penalty functions for improving the Feasibility Pump," DIS Technical Reports 2010-10, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    5. Lokketangen, Arne & Glover, Fred, 1998. "Solving zero-one mixed integer programming problems using tabu search," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 624-658, April.
    6. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.
    7. Weili Zhang & Charles D. Nicholson, 2020. "Objective scaling ensemble approach for integer linear programming," Journal of Heuristics, Springer, vol. 26(1), pages 1-19, February.
    8. He, Yan & Wu, Tao & Zhang, Canrong & Liang, Zhe, 2015. "An improved MIP heuristic for the intermodal hub location problem," Omega, Elsevier, vol. 57(PB), pages 203-211.
    9. Lawrence C. Leung & Yer Van Hui & Yong Wang & Gang Chen, 2009. "A 0--1 LP Model for the Integration and Consolidation of Air Cargo Shipments," Operations Research, INFORMS, vol. 57(2), pages 402-412, April.
    10. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    11. Raymond R. Hill & Charles H. Reilly, 2000. "The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance," Management Science, INFORMS, vol. 46(2), pages 302-317, February.
    12. COPPERSMITH, Don & LEE, Jon, 2000. "Indivisibility and divisibility polytopes," LIDAM Discussion Papers CORE 2000031, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Vasquez, Michel & Vimont, Yannick, 2005. "Improved results on the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 70-81, August.
    14. Letchford, Adam N. & Miller, Sebastian J., 2014. "An aggressive reduction scheme for the simple plant location problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 674-682.
    15. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    16. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2010. "Feasibility Pump-Like Heuristics for Mixed Integer Problems," DIS Technical Reports 2010-15, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    17. Nam-Dũng Hoàng & Thorsten Koch, 2012. "Steiner tree packing revisited," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 76(1), pages 95-123, August.
    18. Saïd Hanafi & Raca Todosijević, 2017. "Mathematical programming based heuristics for the 0–1 MIP: a survey," Journal of Heuristics, Springer, vol. 23(4), pages 165-206, August.
    19. Pierre Hansen & Nenad Mladenović & Raca Todosijević & Saïd Hanafi, 2017. "Variable neighborhood search: basics and variants," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 423-454, September.
    20. Marianna De Santis & Stefano Lucidi & Francesco Rinaldi, 2011. "A new class of functions for measuring solution integrality in the Feasibility Pump approach," DIS Technical Reports 2011-08, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    21. Pooyan Kazemian & Yue Dong & Thomas Rohleder & Jonathan Helm & Mark Van Oyen, 2014. "An IP-based healthcare provider shift design approach to minimize patient handoffs," Health Care Management Science, Springer, vol. 17(1), pages 1-14, March.
    22. Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.
    23. Altay, Nezih & Robinson Jr., Powell E. & Bretthauer, Kurt M., 2008. "Exact and heuristic solution approaches for the mixed integer setup knapsack problem," European Journal of Operational Research, Elsevier, vol. 190(3), pages 598-609, November.
    24. Gyana Parija & Radu Gadidov & Wilbert Wilhelm, 1999. "A Facet Generation Procedure for Solving 0/1 Integer Programs," Operations Research, INFORMS, vol. 47(5), pages 789-791, October.

  16. Egon Balas & Eitan Zemel, 1980. "An Algorithm for Large Zero-One Knapsack Problems," Operations Research, INFORMS, vol. 28(5), pages 1130-1154, October.

    Cited by:

    1. Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi, 2020. "Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks," Annals of Operations Research, Springer, vol. 289(2), pages 153-172, June.
    2. M Hifi & M Michrafy, 2006. "A reactive local search-based algorithm for the disjunctively constrained knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 718-726, June.
    3. Evgeny Gurevsky & Dmitry Kopelevich & Sergey Kovalev & Mikhail Y. Kovalyov, 2023. "Integer knapsack problems with profit functions of the same value range," 4OR, Springer, vol. 21(3), pages 405-419, September.
    4. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
    5. Pisinger, David, 1995. "A minimal algorithm for the multiple-choice knapsack problem," European Journal of Operational Research, Elsevier, vol. 83(2), pages 394-410, June.
    6. Mavrotas, George & Florios, Kostas & Figueira, José Rui, 2015. "An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics," Applied Mathematics and Computation, Elsevier, vol. 270(C), pages 25-43.
    7. Mhand Hifi & Hedi Mhalla & Slim Sadfi, 2005. "Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem," Journal of Combinatorial Optimization, Springer, vol. 10(3), pages 239-260, November.
    8. Wishon, Christopher & Villalobos, J. Rene, 2016. "Robust efficiency measures for linear knapsack problem variants," European Journal of Operational Research, Elsevier, vol. 254(2), pages 398-409.
    9. Kien Trung Nguyen, 2016. "Inverse 1-Median Problem on Block Graphs with Variable Vertex Weights," Journal of Optimization Theory and Applications, Springer, vol. 168(3), pages 944-957, March.
    10. Binh Thanh Dang & Tung Khac Truong, 2022. "Binary salp swarm algorithm for discounted {0-1} knapsack problem," PLOS ONE, Public Library of Science, vol. 17(4), pages 1-28, April.
    11. Kien Trung Nguyen & Nguyen Thanh Hung, 2020. "The inverse connected p-median problem on block graphs under various cost functions," Annals of Operations Research, Springer, vol. 292(1), pages 97-112, September.
    12. M. Drozdowski & N. V. Shakhlevich, 2021. "Scheduling divisible loads with time and cost constraints," Journal of Scheduling, Springer, vol. 24(5), pages 507-521, October.
    13. Michel, S. & Perrot, N. & Vanderbeck, F., 2009. "Knapsack problems with setups," European Journal of Operational Research, Elsevier, vol. 196(3), pages 909-918, August.
    14. Babacar Thiongane & Anass Nagih & Gérard Plateau, 2005. "An Adapted Step Size Algorithm for a 0-1 Biknapsack Lagrangean Dual," Annals of Operations Research, Springer, vol. 139(1), pages 353-373, October.
    15. Al-Shihabi, Sameh, 2021. "A Novel Core-Based Optimization Framework for Binary Integer Programs- the Multidemand Multidimesional Knapsack Problem as a Test Problem," Operations Research Perspectives, Elsevier, vol. 8(C).
    16. Patrick Gemander & Wei-Kun Chen & Dieter Weninger & Leona Gottwald & Ambros Gleixner & Alexander Martin, 2020. "Two-row and two-column mixed-integer presolve using hashing-based pairing methods," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 205-240, October.
    17. Raymond R. Hill & Charles H. Reilly, 2000. "The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance," Management Science, INFORMS, vol. 46(2), pages 302-317, February.
    18. Dell’Amico, Mauro & Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2019. "Mathematical models and decomposition methods for the multiple knapsack problem," European Journal of Operational Research, Elsevier, vol. 274(3), pages 886-899.
    19. T. Kuno, 1999. "Solving a Class of Multiplicative Programs with 0–1 Knapsack Constraints," Journal of Optimization Theory and Applications, Springer, vol. 103(1), pages 121-135, October.
    20. Tsesmetzis, Dimitrios & Roussaki, Ioanna & Sykas, Efstathios, 2008. "QoS-aware service evaluation and selection," European Journal of Operational Research, Elsevier, vol. 191(3), pages 1101-1112, December.
    21. Enrico Angelelli & Renata Mansini & M. Speranza, 2012. "Kernel Search: a new heuristic framework for portfolio selection," Computational Optimization and Applications, Springer, vol. 51(1), pages 345-361, January.
    22. Bjorndal, M. H. & Caprara, A. & Cowling, P. I. & Della Croce, F. & Lourenco, H. & Malucelli, F. & Orman, A. J. & Pisinger, D. & Rego, C. & Salazar, J. J., 1995. "Some thoughts on combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 83(2), pages 253-270, June.
    23. Silvano Martello & David Pisinger & Paolo Toth, 1999. "Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem," Management Science, INFORMS, vol. 45(3), pages 414-424, March.
    24. Reilly, Charles H. & Sapkota, Nabin, 2015. "A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances," European Journal of Operational Research, Elsevier, vol. 241(3), pages 642-652.
    25. Jooken, Jorik & Leyman, Pieter & De Causmaecker, Patrick, 2022. "A new class of hard problem instances for the 0–1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 301(3), pages 841-854.
    26. Mavrotas, George & Figueira, José Rui & Florios, Kostas, 2009. "Solving the bi-objective multidimensional knapsack problem exploiting the concept of core," MPRA Paper 105087, University Library of Munich, Germany.
    27. Mauro Dell’Amico & Giovanni Righini & Matteo Salani, 2006. "A Branch-and-Price Approach to the Vehicle Routing Problem with Simultaneous Distribution and Collection," Transportation Science, INFORMS, vol. 40(2), pages 235-247, May.
    28. Behrooz Alizadeh & Esmaeil Afrashteh & Fahimeh Baroughi, 2018. "Combinatorial Algorithms for Some Variants of Inverse Obnoxious Median Location Problem on Tree Networks," Journal of Optimization Theory and Applications, Springer, vol. 178(3), pages 914-934, September.
    29. van Eekelen, Wouter, 2023. "Distributionally robust views on queues and related stochastic models," Other publications TiSEM 9b99fc05-9d68-48eb-ae8c-9, Tilburg University, School of Economics and Management.
    30. Esmaeil Afrashteh & Behrooz Alizadeh & Fahimeh Baroughi & Kien Trung Nguyen, 2018. "Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(05), pages 1-22, October.
    31. Alberto Ceselli & Giovanni Righini, 2008. "An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem," Operations Research, INFORMS, vol. 56(2), pages 425-436, April.
    32. Setzer, Thomas & Blanc, Sebastian M., 2020. "Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems," European Journal of Operational Research, Elsevier, vol. 282(1), pages 58-70.
    33. Martello, Silvano & Toth, Paolo, 1995. "The bottleneck generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 83(3), pages 621-638, June.
    34. Yoshiaki Ohsawa & Naoya Ozaki & Frank Plastria, 2008. "Equity-Efficiency Bicriteria Location with Squared Euclidean Distances," Operations Research, INFORMS, vol. 56(1), pages 79-87, February.
    35. M Hifi & M Michrafy & A Sbihi, 2004. "Heuristic algorithms for the multiple-choice multidimensional knapsack problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1323-1332, December.
    36. Elisabeth Gassner, 2009. "A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric," Annals of Operations Research, Springer, vol. 172(1), pages 393-404, November.
    37. M. Hosein Zare & Oleg A. Prokopyev & Denis Sauré, 2020. "On Bilevel Optimization with Inexact Follower," Decision Analysis, INFORMS, vol. 17(1), pages 74-95, March.
    38. Arnaud Fréville & SaÏd Hanafi, 2005. "The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects," Annals of Operations Research, Springer, vol. 139(1), pages 195-227, October.
    39. Nicholas G. Hall & Marc E. Posner, 2007. "Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures," Operations Research, INFORMS, vol. 55(4), pages 703-716, August.
    40. Alizadeh, Behrooz & Afrashteh, Esmaeil, 2020. "Budget-constrained inverse median facility location problem on tree networks," Applied Mathematics and Computation, Elsevier, vol. 375(C).
    41. Fatemeh Sarayloo & Teodor Gabriel Crainic & Walter Rei, 2021. "A reduced cost-based restriction and refinement matheuristic for stochastic network design problem," Journal of Heuristics, Springer, vol. 27(3), pages 325-351, June.
    42. Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
    43. Pisinger, David, 1995. "Avoiding anomalies in the 2 algorithm by Martello and Toth," European Journal of Operational Research, Elsevier, vol. 82(1), pages 206-208, April.
    44. Li, Jiliu & Xu, Min & Sun, Peng, 2022. "Two-echelon capacitated vehicle routing problem with grouping constraints and simultaneous pickup and delivery," Transportation Research Part B: Methodological, Elsevier, vol. 162(C), pages 261-291.
    45. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
    46. Altay, Nezih & Robinson Jr., Powell E. & Bretthauer, Kurt M., 2008. "Exact and heuristic solution approaches for the mixed integer setup knapsack problem," European Journal of Operational Research, Elsevier, vol. 190(3), pages 598-609, November.
    47. Pisinger, David, 1995. "An expanding-core algorithm for the exact 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 175-187, November.
    48. S. Knust & N. V. Shakhlevich & S. Waldherr & C. Weiß, 2019. "Shop scheduling problems with pliable jobs," Journal of Scheduling, Springer, vol. 22(6), pages 635-661, December.
    49. David Pisinger, 1999. "Core Problems in Knapsack Algorithms," Operations Research, INFORMS, vol. 47(4), pages 570-575, August.

  17. Egon Balas & Manfred Padberg, 1975. "On the Set-Covering Problem: II. An Algorithm for Set Partitioning," Operations Research, INFORMS, vol. 23(1), pages 74-90, February.

    Cited by:

    1. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2022. "Integral Column Generation for Set Partitioning Problems with Side Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2313-2331, July.
    2. Rosat, Samuel & Quesnel, Frédéric & Elhallaoui, Issmail & Soumis, François, 2017. "Dynamic penalization of fractional directions in the integral simplex using decomposition: Application to aircrew scheduling," European Journal of Operational Research, Elsevier, vol. 263(3), pages 1007-1018.
    3. Andrei V. Nikolaev & Egor V. Klimov, 2024. "Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-31, July.
    4. Omar Foutlane & Issmail Hallaoui & Pierre Hansen, 2022. "Distributed Integral Column Generation for Set Partitioning Problems," SN Operations Research Forum, Springer, vol. 3(2), pages 1-22, June.
    5. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2019. "Integral column generation for the set partitioning problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 713-744, December.
    6. Rönnberg, Elina & Larsson, Torbjörn, 2009. "Column generation in the integral simplex method," European Journal of Operational Research, Elsevier, vol. 192(1), pages 333-342, January.
    7. Sujeevraja Sanjeevi & Saravanan Venkatachalam, 2021. "Robust flight schedules with stochastic programming," Annals of Operations Research, Springer, vol. 305(1), pages 403-421, October.
    8. Abdelouahab Zaghrouti & François Soumis & Issmail El Hallaoui, 2014. "Integral Simplex Using Decomposition for the Set Partitioning Problem," Operations Research, INFORMS, vol. 62(2), pages 435-449, April.
    9. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2018. "Improved integral simplex using decomposition for the set partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 185-206, June.
    10. Sarin, Subhash C. & Aggarwal, Sanjay, 2001. "Modeling and algorithmic development of a staff scheduling problem," European Journal of Operational Research, Elsevier, vol. 128(3), pages 558-569, February.
    11. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2020. "Improving set partitioning problem solutions by zooming around an improving direction," Annals of Operations Research, Springer, vol. 284(2), pages 645-671, January.

  18. Egon Balas & Manfred W. Padberg, 1972. "On the Set-Covering Problem," Operations Research, INFORMS, vol. 20(6), pages 1152-1161, December.

    Cited by:

    1. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2022. "Integral Column Generation for Set Partitioning Problems with Side Constraints," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 2313-2331, July.
    2. Rönnberg, Elina & Larsson, Torbjörn, 2014. "All-integer column generation for set partitioning: Basic principles and extensions," European Journal of Operational Research, Elsevier, vol. 233(3), pages 529-538.
    3. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    4. Goldengorin, Boris, 2009. "Maximization of submodular functions: Theory and enumeration algorithms," European Journal of Operational Research, Elsevier, vol. 198(1), pages 102-112, October.
    5. Fernández, Elena & Pozo, Miguel A. & Puerto, Justo & Scozzari, Andrea, 2017. "Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem," European Journal of Operational Research, Elsevier, vol. 260(3), pages 886-903.
    6. Elena Fernández & Justo Puerto & Antonio Rodríguez-Chía, 2013. "On discrete optimization with ordering," Annals of Operations Research, Springer, vol. 207(1), pages 83-96, August.
    7. Adil Tahir & Guy Desaulniers & Issmail El Hallaoui, 2019. "Integral column generation for the set partitioning problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(5), pages 713-744, December.
    8. Rönnberg, Elina & Larsson, Torbjörn, 2009. "Column generation in the integral simplex method," European Journal of Operational Research, Elsevier, vol. 192(1), pages 333-342, January.
    9. Sujeevraja Sanjeevi & Saravanan Venkatachalam, 2021. "Robust flight schedules with stochastic programming," Annals of Operations Research, Springer, vol. 305(1), pages 403-421, October.
    10. Abdelouahab Zaghrouti & François Soumis & Issmail El Hallaoui, 2014. "Integral Simplex Using Decomposition for the Set Partitioning Problem," Operations Research, INFORMS, vol. 62(2), pages 435-449, April.
    11. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2018. "Improved integral simplex using decomposition for the set partitioning problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(2), pages 185-206, June.
    12. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Discussion Paper 1995-57, Tilburg University, Center for Economic Research.
    13. Aardal, K. & van Hoesel, C.P.M., 1995. "Polyhedral techniques in combinatorial optimization," Research Memorandum 014, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    14. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2020. "Improving set partitioning problem solutions by zooming around an improving direction," Annals of Operations Research, Springer, vol. 284(2), pages 645-671, January.

  19. Egon Balas & V. Joseph Bowman & Fred Glover & David Sommer, 1971. "An Intersection Cut from the Dual of the Unit Hypercube," Operations Research, INFORMS, vol. 19(1), pages 40-44, February.

    Cited by:

    1. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.

  20. Egon Balas, 1971. "Intersection Cuts—A New Type of Cutting Planes for Integer Programming," Operations Research, INFORMS, vol. 19(1), pages 19-39, February.

    Cited by:

    1. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    2. Kent Andersen & Gérard Cornuéjols & Yanjun Li, 2005. "Reduce-and-Split Cuts: Improving the Performance of Mixed-Integer Gomory Cuts," Management Science, INFORMS, vol. 51(11), pages 1720-1732, November.
    3. Jing Hu & John Mitchell & Jong-Shi Pang & Bin Yu, 2012. "On linear programs with linear complementarity constraints," Journal of Global Optimization, Springer, vol. 53(1), pages 29-51, May.
    4. Álinson S. Xavier & Ricardo Fukasawa & Laurent Poirrier, 2021. "Multirow Intersection Cuts Based on the Infinity Norm," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1624-1643, October.
    5. Egon Balas & Sebastián Ceria & Milind Dawande & Francois Margot & Gábor Pataki, 2001. "Octane: A New Heuristic for Pure 0--1 Programs," Operations Research, INFORMS, vol. 49(2), pages 207-225, April.
    6. Egon Balas & Thiago Serra, 2020. "When Lift-and-Project Cuts Are Different," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 822-834, July.
    7. Hu, Jian & Bansal, Manish & Mehrotra, Sanjay, 2018. "Robust decision making using a general utility set," European Journal of Operational Research, Elsevier, vol. 269(2), pages 699-714.
    8. Alberto Del Pia & Robert Weismantel, 2016. "Relaxations of mixed integer sets from lattice-free polyhedra," Annals of Operations Research, Springer, vol. 240(1), pages 95-117, May.
    9. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation I: foundations and taxonomy," 4OR, Springer, vol. 14(1), pages 1-40, March.
    10. Mitchell, John E., 1997. "Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems," European Journal of Operational Research, Elsevier, vol. 97(1), pages 139-148, February.
    11. Amitabh Basu & Robert Hildebrand & Matthias Köppe, 2016. "Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms," 4OR, Springer, vol. 14(2), pages 107-131, June.
    12. Trang T. Nguyen & Jean-Philippe P. Richard & Mohit Tawarmalani, 2021. "Convexification techniques for linear complementarity constraints," Journal of Global Optimization, Springer, vol. 80(2), pages 249-286, June.
    13. Fischetti, Matteo & Monaci, Michele, 2020. "A branch-and-cut algorithm for Mixed-Integer Bilinear Programming," European Journal of Operational Research, Elsevier, vol. 282(2), pages 506-514.
    14. Matteo Fischetti & Ivana Ljubić & Michele Monaci & Markus Sinnl, 2017. "A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs," Operations Research, INFORMS, vol. 65(6), pages 1615-1637, December.
    15. Wesselmann, Franz & Koberstein, Achim & Suhl, Uwe H., 2011. "Pivot-and-reduce cuts: An approach for improving Gomory mixed-integer cuts," European Journal of Operational Research, Elsevier, vol. 214(1), pages 15-26, October.
    16. Akang Wang & Chrysanthos E. Gounaris, 2021. "On tackling reverse convex constraints for non-overlapping of unequal circles," Journal of Global Optimization, Springer, vol. 80(2), pages 357-385, June.

  21. Egon Balas, 1969. "Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm," Operations Research, INFORMS, vol. 17(6), pages 941-957, December.

    Cited by:

    1. Mascis, Alessandro & Pacciarelli, Dario, 2002. "Job-shop scheduling with blocking and no-wait constraints," European Journal of Operational Research, Elsevier, vol. 143(3), pages 498-517, December.
    2. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    3. Sándor Szabó, 2021. "A Clique Search Problem and its Application to Machine Scheduling," SN Operations Research Forum, Springer, vol. 2(4), pages 1-12, December.
    4. Kolisch, Rainer & Padman, Rema, 1997. "An integrated survey of project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 463, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    6. Demirkol, Ebru & Mehta, Sanjay & Uzsoy, Reha, 1998. "Benchmarks for shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 109(1), pages 137-141, August.
    7. Wei Xiong & Dongmei Fu, 2018. "A new immune multi-agent system for the flexible job shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 857-873, April.
    8. Leonardo Lamorgese & Carlo Mannino, 2019. "A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management," Operations Research, INFORMS, vol. 67(6), pages 1586-1609, November.
    9. Vitoriano, B. & Ortuno, M. T. & Recio, B. & Rubio, F. & Alonso-Ayuso, A., 2003. "Two alternative models for farm management: Discrete versus continuous time horizon," European Journal of Operational Research, Elsevier, vol. 144(3), pages 613-628, February.
    10. Steinhofel, K. & Albrecht, A. & Wong, C. K., 1999. "Two simulated annealing-based heuristics for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 118(3), pages 524-548, November.
    11. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1995. "Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem," European Journal of Operational Research, Elsevier, vol. 80(1), pages 94-102, January.
    12. Zoghby, Jeriad & Wesley Barnes, J. & Hasenbein, John J., 2005. "Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches," European Journal of Operational Research, Elsevier, vol. 167(2), pages 336-348, December.
    13. Michael Pinedo & Marcos Singer, 1999. "A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(1), pages 1-17, February.
    14. Abdollah Arasteh, 2020. "Considering Project Management Activities for Engineering Design Groups," SN Operations Research Forum, Springer, vol. 1(4), pages 1-29, December.
    15. Pezzella, Ferdinando & Merelli, Emanuela, 2000. "A tabu search method guided by shifting bottleneck for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 120(2), pages 297-310, January.
    16. Amaral Armentano, Vinicius & Rigao Scrich, Cintia, 2000. "Tabu search for minimizing total tardiness in a job shop," International Journal of Production Economics, Elsevier, vol. 63(2), pages 131-140, January.
    17. Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "A tabu search approach to machine scheduling," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 277-300, April.
    18. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.
    19. Jonas Harbering & Abhiram Ranade & Marie Schmidt & Oliver Sinnen, 2019. "Complexity, bounds and dynamic programming algorithms for single track train scheduling," Annals of Operations Research, Springer, vol. 273(1), pages 479-500, February.
    20. Yuri N. Sotskov & Omid Gholami, 2017. "Mixed graph model and algorithms for parallel-machine job-shop scheduling problems," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1549-1564, March.
    21. Leonardo Lamorgese & Carlo Mannino, 2015. "An Exact Decomposition Approach for the Real-Time Train Dispatching Problem," Operations Research, INFORMS, vol. 63(1), pages 48-64, February.
    22. Yanwei Sang & Jianping Tan, 2022. "Many-Objective Flexible Job Shop Scheduling Problem with Green Consideration," Energies, MDPI, vol. 15(5), pages 1-17, March.
    23. Leutwiler, Florin & Corman, Francesco, 2022. "A logic-based Benders decomposition for microscopic railway timetable planning," European Journal of Operational Research, Elsevier, vol. 303(2), pages 525-540.
    24. Carlo Mannino & Alessandro Mascis, 2009. "Optimal Real-Time Traffic Control in Metro Stations," Operations Research, INFORMS, vol. 57(4), pages 1026-1039, August.
    25. Pierre Hansen & Julio Kuplinsky & Dominique Werra, 1997. "Mixed graph colorings," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(1), pages 145-160, February.
    26. Rego, César & Duarte, Renato, 2009. "A filter-and-fan approach to the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 194(3), pages 650-662, May.
    27. Braune, R. & Zäpfel, G. & Affenzeller, M., 2012. "An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective," European Journal of Operational Research, Elsevier, vol. 218(1), pages 76-85.
    28. Frank Benda & Roland Braune & Karl F. Doerner & Richard F. Hartl, 2019. "A machine learning approach for flow shop scheduling problems with alternative resources, sequence-dependent setup times, and blocking," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(4), pages 871-893, December.
    29. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    30. Bürgy, Reinhard & Bülbül, Kerem, 2018. "The job shop scheduling problem with convex costs," European Journal of Operational Research, Elsevier, vol. 268(1), pages 82-100.
    31. Corman, Francesco & D'Ariano, Andrea & Pacciarelli, Dario & Pranzo, Marco, 2010. "A tabu search algorithm for rerouting trains during rail operations," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 175-192, January.
    32. Chong Peng & Guanglin Wu & T Warren Liao & Hedong Wang, 2019. "Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem," PLOS ONE, Public Library of Science, vol. 14(9), pages 1-19, September.
    33. Yuri N. Sotskov, 2020. "Mixed Graph Colorings: A Historical Review," Mathematics, MDPI, vol. 8(3), pages 1-24, March.
    34. Abdelmaguid, Tamer F., 2015. "A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times," Applied Mathematics and Computation, Elsevier, vol. 260(C), pages 188-203.
    35. Andrea D'Ariano & Francesco Corman & Dario Pacciarelli & Marco Pranzo, 2008. "Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time," Transportation Science, INFORMS, vol. 42(4), pages 405-419, November.
    36. Egon Balas & Alkis Vazacopoulos, 1998. "Guided Local Search with Shifting Bottleneck for Job Shop Scheduling," Management Science, INFORMS, vol. 44(2), pages 262-275, February.
    37. Hosseini, Amir & Otto, Alena & Pesch, Erwin, 2024. "Scheduling in manufacturing with transportation: Classification and solution techniques," European Journal of Operational Research, Elsevier, vol. 315(3), pages 821-843.
    38. Hoksung Yau & Leyuan Shi, 2009. "Nested partitions for the large-scale extended job shop scheduling problem," Annals of Operations Research, Springer, vol. 168(1), pages 23-39, April.
    39. Sprecher, Arno & Kolisch, Rainer & Drexl, Andreas, 1993. "Semi-active, active and non-delay schedules for the resource-constrained project scheduling problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 307, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

  22. Egon Balas, 1969. "Duality in Discrete Programming: II. The Quadratic Case," Management Science, INFORMS, vol. 16(1), pages 14-32, September.

    Cited by:

    1. Djerdjour, Mohamed, 1997. "An enumerative algorithm framework for a class of nonlinear integer programming problems," European Journal of Operational Research, Elsevier, vol. 101(1), pages 104-121, August.

  23. Egon Balas, 1968. "Letter to the Editor—A Note on the Branch-and-Bound Principle," Operations Research, INFORMS, vol. 16(2), pages 442-445, April.

    Cited by:

    1. Lenstra, J. K. & Rinnooy Kan, A. H. G., 1980. "A Recursive Approach To The Implementation Of Enumerative Methods," Econometric Institute Archives 272202, Erasmus University Rotterdam.

  24. Egon Balas, 1967. "Discrete Programming by the Filter Method," Operations Research, INFORMS, vol. 15(5), pages 915-957, October.

    Cited by:

    1. Joseph, Anito & Gass, Saul I. & Bryson, Noel, 1998. "An objective hyperplane search procedure for solving the general all-integer linear programming (ILP) problem," European Journal of Operational Research, Elsevier, vol. 104(3), pages 601-614, February.
    2. Jouglet, Antoine & Carlier, Jacques, 2011. "Dominance rules in combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 212(3), pages 433-444, August.
    3. Balev, Stefan & Yanev, Nicola & Freville, Arnaud & Andonov, Rumen, 2008. "A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem," European Journal of Operational Research, Elsevier, vol. 186(1), pages 63-76, April.
    4. Jiang, Bo & Tzavellas, Hector, 2023. "Optimal liquidity allocation in an equity network," International Review of Economics & Finance, Elsevier, vol. 85(C), pages 286-294.
    5. Mohammadi Bidhandi, Hadi & Mohd. Yusuff, Rosnah & Megat Ahmad, Megat Mohamad Hamdan & Abu Bakar, Mohd Rizam, 2009. "Development of a new approach for deterministic supply chain network design," European Journal of Operational Research, Elsevier, vol. 198(1), pages 121-128, October.
    6. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    7. Nikolaos Argyris & José Figueira & Alec Morton, 2011. "Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem," Journal of Global Optimization, Springer, vol. 49(2), pages 213-235, February.
    8. van Dam, Wim & Telgen, Jan, 1978. "Some Computational Experiments With A Primal-Dual Surrogate Simplex Algorithm," Econometric Institute Archives 272174, Erasmus University Rotterdam.

  25. Egon Balas, 1966. "An Infeasibility-Pricing Decomposition Method for Linear Programs," Operations Research, INFORMS, vol. 14(5), pages 847-873, October.

    Cited by:

    1. Heinemann, Hergen H., 1971. "Ein allgemeines Dekompositionsverfahren fuer lineare Optimierungsprobleme [A General Decomposition Algorithm for Linear Optimization Problems]," MPRA Paper 28842, University Library of Munich, Germany.

  26. Egon Balas, 1966. "The Dual Method for the Generalized Transportation Problem," Management Science, INFORMS, vol. 12(7), pages 555-568, March.

    Cited by:

    1. Marcin Anholcer, 2013. "Stochastic Generalized Transportation Problem with discrete distribution of demand," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 23(4), pages 9-19.
    2. V. Balachandran & G.L. Thompson, 1974. "An Operator Theory of Parametric Programming for the Generalized Transportation Problem, I : Basic Theory," Discussion Papers 67, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Marcin Anholcer, 2012. "Algorithm for the stochastic generalized transportation problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 22(4), pages 9-20.

  27. Egon Balas, 1965. "An Additive Algorithm for Solving Linear Programs with Zero-One Variables," Operations Research, INFORMS, vol. 13(4), pages 517-546, August.

    Cited by:

    1. Woiler, Samsão, 1969. "Enumeração implícita aplicada à seleção de investimentos," RAE - Revista de Administração de Empresas, FGV-EAESP Escola de Administração de Empresas de São Paulo (Brazil), vol. 9(4), October.
    2. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    3. Thomas L. Magnanti, 2021. "Optimization: From Its Inception," Management Science, INFORMS, vol. 67(9), pages 5349-5363, September.
    4. Manfred Padberg, 2005. "Classical Cuts for Mixed-Integer Programming and Branch-and-Cut," Annals of Operations Research, Springer, vol. 139(1), pages 321-352, October.
    5. S Das & D Ghosh, 2003. "Binary knapsack problems with random budgets," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(9), pages 970-983, September.
    6. Sinuany-Stern, Zilla, 2023. "Foundations of operations research: From linear programming to data envelopment analysis," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1069-1080.
    7. Fu Lin & Sven Leyffer & Todd Munson, 2016. "A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings," Computational Optimization and Applications, Springer, vol. 65(1), pages 1-46, September.
    8. Michael Brusco & Hans-Friedrich Köhn & Douglas Steinley, 2015. "An Exact Method for Partitioning Dichotomous Items Within the Framework of the Monotone Homogeneity Model," Psychometrika, Springer;The Psychometric Society, vol. 80(4), pages 949-967, December.
    9. Sangbum Lee & Ignacio Grossmann, 2005. "Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems," Annals of Operations Research, Springer, vol. 139(1), pages 267-288, October.
    10. Robert M. Saltzman & Frederick S. Hillier, 1991. "An exact ceiling point algorithm for general integer linear programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 53-69, February.
    11. Mohammad Sabbagh & Richard Soland, 2009. "An improved partial enumeration algorithm for integer programming problems," Annals of Operations Research, Springer, vol. 166(1), pages 147-161, February.
    12. Robert G. Dyson & Frances A. O’Brien & Devan B. Shah, 2021. "Soft OR and Practice: The Contribution of the Founders of Operations Research," Operations Research, INFORMS, vol. 69(3), pages 727-738, May.
    13. Mazzola, Joseph B. & Neebe, Alan W. & Rump, Christopher M., 1998. "Multiproduct production planning in the presence of work-force learning," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 336-356, April.
    14. Michael Brusco & Renu Singh & Douglas Steinley, 2009. "Variable Neighborhood Search Heuristics for Selecting a Subset of Variables in Principal Component Analysis," Psychometrika, Springer;The Psychometric Society, vol. 74(4), pages 705-726, December.
    15. Jon Lee, 2002. "All-Different Polytopes," Journal of Combinatorial Optimization, Springer, vol. 6(3), pages 335-352, September.
    16. Jiang, Bo & Tzavellas, Hector, 2023. "Optimal liquidity allocation in an equity network," International Review of Economics & Finance, Elsevier, vol. 85(C), pages 286-294.
    17. Kurt Spielberg, 2007. "IP over 40+ Years at IBM Scientific Centers and Marketing," Annals of Operations Research, Springer, vol. 149(1), pages 195-208, February.
    18. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    19. Abumoslem Mohammadi & Javad Tayyebi, 2019. "Maximum Capacity Path Interdiction Problem with Fixed Costs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 36(04), pages 1-21, August.
    20. Monique Guignard & Ellis Johnson & Kurt Spielberg, 2005. "Logical Processing for Integer Programming," Annals of Operations Research, Springer, vol. 140(1), pages 263-304, November.
    21. Gary Klein & Jay E. Aronson, 1991. "Optimal clustering: A model and method," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 447-461, June.
    22. Bala Shetty, 1990. "A relaxation/decomposition algorithm for the fixed charged network problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 327-340, April.
    23. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    24. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    25. Michael Brusco & Patrick Doreian, 2015. "An Exact Algorithm for the Two-Mode KL-Means Partitioning Problem," Journal of Classification, Springer;The Classification Society, vol. 32(3), pages 481-515, October.
    26. Tayyebi, Javad & Mitra, Ankan & Sefair, Jorge A., 2023. "The continuous maximum capacity path interdiction problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 38-52.
    27. Hasan Pirkul, 1987. "A heuristic solution procedure for the multiconstraint zero‐one knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(2), pages 161-172, April.
    28. Heungsoon Felix Lee & Daniel R. Dooly, 1996. "Algorithms for the constrained maximum‐weight connected graph problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(7), pages 985-1008, October.
    29. Ghosh, Diptesh & Sumanta Basu, 2011. "Diversified Local Search for the Traveling Salesman Problem," IIMA Working Papers WP2011-01-03, Indian Institute of Management Ahmedabad, Research and Publication Department.
    30. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    31. J. Glover & V. Quan & S. Zolfaghari, 2021. "Some new perspectives for solving 0–1 integer programming problems using Balas method," Computational Management Science, Springer, vol. 18(2), pages 177-193, June.
    32. Wang, Hsiao-Fan & Horng, Jyh-Shing, 1996. "Structural approach to parametric analysis of an IP on the case of the right-hand side," European Journal of Operational Research, Elsevier, vol. 92(1), pages 148-156, July.
    33. Wellington, John F. & Guiffrida, Alfred L. & Lewis, Stephen A., 2014. "Interior analysis of the green product mix solution," European Journal of Operational Research, Elsevier, vol. 237(3), pages 966-974.

  28. Egon Balas, 1965. "Solution of Large-Scale Transportation Problems Through Aggregation," Operations Research, INFORMS, vol. 13(1), pages 82-93, February.

    Cited by:

    1. Young Woong Park, 2021. "Optimization for L 1 -Norm Error Fitting via Data Aggregation," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 120-142, January.

  29. E. Balas & P. L. Ivanescu, 1964. "On the Generalized Transportation Problem," Management Science, INFORMS, vol. 11(1), pages 188-202, September.

    Cited by:

    1. Marcin Anholcer, 2013. "Stochastic Generalized Transportation Problem with discrete distribution of demand," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 23(4), pages 9-19.
    2. René Brandenberg & Paul Stursberg, 2021. "Refined cut selection for benders decomposition: applied to network capacity expansion problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 383-412, December.
    3. V. Balachandran & G.L. Thompson, 1974. "A Note on 'Computational Simplifications in Solving Generalized Transportation Problems,' by Glover and Kingman," Discussion Papers 66, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    4. Marcin Anholcer, 2012. "Algorithm for the stochastic generalized transportation problem," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 22(4), pages 9-20.

Chapters

    Sorry, no citations of chapters recorded.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.