{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:39:16Z","timestamp":1743125956797,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319276021"},{"type":"electronic","value":"9783319276045"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-27604-5_5","type":"book-chapter","created":{"date-parts":[[2016,1,22]],"date-time":"2016-01-22T23:39:53Z","timestamp":1453505993000},"page":"125-131","source":"Crossref","is-referenced-by-count":0,"title":["Other Applications in General Integer Programming"],"prefix":"10.1007","author":[{"given":"Cl\u00e1udio","family":"Alves","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Clautiaux","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Val\u00e9rio","family":"de Carvalho","sequence":"additional","affiliation":[]},{"given":"J\u00fcrgen","family":"Rietz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,24]]},"reference":[{"key":"5_CR1","volume-title":"Polyhedral combinatorics","author":"K Aardal","year":"1997","unstructured":"Aardal K, Weismantel R (1997) Polyhedral combinatorics. Wiley, New York"},{"key":"5_CR2","unstructured":"Alves C (2005) Cutting and packing: problems, models and exact algorithms. PhD thesis, Universidade do Minho, Guimaraes"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ejor.2013.08.011","volume":"233","author":"C Alves","year":"2014","unstructured":"Alves C, Val\u00e9rio de Carvalho J, Clautiaux F, Rietz J (2014) Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem. Eur J Oper Res 233:43\u201363","journal-title":"Eur J Oper Res"},{"key":"5_CR4","volume-title":"Linear programming and network flows","author":"M Bazaraa","year":"2010","unstructured":"Bazaraa M, Jarvis J, Sherali H (2010) Linear programming and network flows. Wiley, New York"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Boschetti M, Mingozzi A (2003) The two-dimensional finite bin packing problem. Part I: new lower bounds for the oriented case. 4 OR 1:27\u201342","DOI":"10.1007\/s10288-002-0005-z"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0167-5060(08)70730-1","volume":"1","author":"C Burdett","year":"1977","unstructured":"Burdett C, Johnson E (1977) A subadditive approach to solve linear integer programs. Ann Discret Math 1:117\u2013144","journal-title":"Ann Discret Math"},{"key":"5_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/11496915_28","volume-title":"Integer programming and combinatorial optimization, 11th international IPCO conference, Berlin, 8\u201310 June 2005","author":"A Caprara","year":"2005","unstructured":"Caprara A, Locatelli M, Monaci M (2005) Bilinear packing by bilinear programming. In: J\u00fcnger M, Kaibel V (eds) Integer programming and combinatorial optimization, 11th international IPCO conference, Berlin, 8\u201310 June 2005. Lecture notes in computer science, vol 3509. Springer, Berlin, pp 377\u2013391"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1016\/j.ejor.2005.09.034","volume":"176","author":"J Carlier","year":"2007","unstructured":"Carlier J, N\u00e9ron E (2007a) Computing redundant resources for cumulative scheduling problems. Eur J Oper Res 176(3):1452\u20131463","journal-title":"Eur J Oper Res"},{"issue":"3","key":"5_CR9","doi-asserted-by":"publisher","first-page":"1452","DOI":"10.1016\/j.ejor.2005.09.034","volume":"176","author":"J Carlier","year":"2007","unstructured":"Carlier J, N\u00e9ron E (2007b) Computing redundant resources for the resource constrained project scheduling problem. Eur J Oper Res 176(3):1452\u20131463","journal-title":"Eur J Oper Res"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"2223","DOI":"10.1016\/j.cor.2005.08.012","volume":"34","author":"J Carlier","year":"2007","unstructured":"Carlier J, Clautiaux F, Moukrim A (2007) New reduction procedures and lower bounds for the two-dimensional bin-packing problem with fixed orientation. Comput Oper Res 34:2223\u20132250","journal-title":"Comput Oper Res"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal V (1973) Edmonds polytopes and a hierarchy of combinatorial problems. Discret Math 4:305\u2013337","journal-title":"Discret Math"},{"key":"5_CR12","unstructured":"Clautiaux F (2010) New collaborative approaches for bin-packing problems. Habilitation \u00e0 Diriger des Recherches, Universit\u00e9 de Lille 1, France"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/j.orl.2006.07.001","volume":"35","author":"F Clautiaux","year":"2007","unstructured":"Clautiaux F, Jouglet A, Hayek J (2007) A new lower bound for the non-oriented two-dimensional bin-packing problem. Oper Res Lett 35:365\u2013373","journal-title":"Oper Res Lett"},{"key":"5_CR14","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10479-008-0453-8","volume":"179","author":"F Clautiaux","year":"2010","unstructured":"Clautiaux F, Alves C, Val\u00e9rio de Carvalho J (2010) A survey of dual-feasible and superadditive functions. Ann Oper Res 179:317\u2013342","journal-title":"Ann Oper Res"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig GB, Wolfe P (1960) Decomposition principle for linear programs. Oper Res 8:101\u2013111","journal-title":"Oper Res"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10107-005-0599-y","volume":"105","author":"S Dash","year":"2006","unstructured":"Dash S, G\u00fcnl\u00fck O (2006) Valid inequalities based on simple mixed-integer sets. Math Program 105:29\u201353","journal-title":"Math Program"},{"key":"5_CR17","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s101070100243","volume":"91","author":"S Fekete","year":"2001","unstructured":"Fekete S, Schepers J (2001) New classes of fast lower bounds for bin packing problems. Math Program 91:11\u201331","journal-title":"Math Program"},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s001860400376","volume":"60","author":"S Fekete","year":"2004","unstructured":"Fekete S, Schepers J (2004) A general framework for bounds for higher-dimensional orthogonal packing problems. Math Meth Oper Res 60:311\u2013329","journal-title":"Math Meth Oper Res"},{"key":"5_CR19","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A Geoffrion","year":"1974","unstructured":"Geoffrion A (1974) Lagrangian relaxation and its uses in integer programming. Math Program Study 2:82\u2013114","journal-title":"Math Program Study"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P Gilmore","year":"1961","unstructured":"Gilmore P, Gomory R (1961) A linear programming approach to the cutting stock problem (part I). Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R Gomory","year":"1958","unstructured":"Gomory R (1958) Outline of an algorithm for integer solutions to linear programs. Bull Am Math Soc 64:275\u2013278","journal-title":"Bull Am Math Soc"},{"key":"5_CR22","volume-title":"Near optimal bin packing algorithms","author":"D Johnson","year":"1973","unstructured":"Johnson D (1973) Near optimal bin packing algorithms. Dissertation, Massachussetts Institute of Technology, Cambridge, MA"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.ejor.2010.01.037","volume":"206","author":"A Khanafer","year":"2010","unstructured":"Khanafer A, Clautiaux F, Talbi E (2010) New lower bounds for bin packing problems with conflicts. Eur J Oper Res 206:281\u2013288","journal-title":"Eur J Oper Res"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/S0167-6377(02)00112-8","volume":"30","author":"A Letchford","year":"2002","unstructured":"Letchford A, Lodi A (2002) Strengthening Chv\u00e1val-Gomory cuts and Gomory fractional cuts. Oper Res Lett 30:74\u201382","journal-title":"Oper Res Lett"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Lueker G (1983) Bin packing with items uniformly distributed over intervals [a,b]. In: Proceedings of the 24th annual symposium on foundations of computer science (FOCS 83). IEEE Computer Society, Silver Spring, MD, pp 289\u2013297","DOI":"10.1109\/SFCS.1983.9"},{"key":"5_CR26","volume-title":"Knapsack problems - algorithms and computer implementation","author":"S Martello","year":"1990","unstructured":"Martello S, Toth P (1990) Knapsack problems - algorithms and computer implementation. Wiley, Chichester"},{"key":"5_CR27","volume-title":"Integer and combinatorial optimization","author":"G Nemhauser","year":"1998","unstructured":"Nemhauser G, Wolsey L (1998) Integer and combinatorial optimization. Wiley, New York"},{"key":"5_CR28","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.orl.2010.01.002","volume":"38","author":"J Rietz","year":"2010","unstructured":"Rietz J, Alves C, Val\u00e9rio de Carvalho J (2010) Theoretical investigations on maximal dual feasible functions. Oper Res Lett 38:174\u2013178","journal-title":"Oper Res Lett"},{"key":"5_CR29","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.orl.2011.10.011","volume":"40","author":"J Rietz","year":"2012","unstructured":"Rietz J, Alves C, Val\u00e9rio de Carvalho J (2012a) On the extremality of maximal dual feasible functions. Oper Res Lett 40:25\u201330","journal-title":"Oper Res Lett"},{"key":"5_CR30","unstructured":"Rietz J, Alves C, Val\u00e9rio de Carvalho J, Clautiaux F (2012b) Computing valid inequalities for general integer programs using an extension of maximal dual-feasible functions to negative arguments. In: Proceedings of the 1st international conference on operations research and enterprise systems (ICORES 2012)"},{"key":"5_CR31","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/978-3-319-09129-7_14","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2014","author":"J\u00fcrgen Rietz","year":"2014","unstructured":"Rietz J, Alves C, Val\u00e9rio de Carvalho J, Clautiaux F (2014) On the properties of general dual-feasible functions. In: Murgante B, Misra S, Rocha AMAC, Torre C, Rocha JG, Falc\u00e3o MI, Taniar D, Apduhan BO, Gervasi O (eds) Computational science and its applications \u2013 ICCSA 2014. Lecture notes on computer science, vol 8580. Springer, pp 180\u2013194. doi:10.1007\/978-3-319-09129-7_14. \n                  http:\/\/dx.doi.org\/10.1007\/978-3-319-09129-7_14"},{"key":"5_CR32","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.orl.2015.06.002","volume":"43","author":"J Rietz","year":"2015","unstructured":"Rietz J, Alves C, Val\u00e9rio de Carvalho J, Clautiaux F (2015) Constructing general dual-feasible functions. Oper Res Lett 43:427\u2013431","journal-title":"Oper Res Lett"},{"key":"5_CR33","first-page":"309","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson N, Seymour P (1986) Graph minors. II algorithmic aspects of tree-width. J Algorithms 7:309\u2013322","journal-title":"II algorithmic aspects of tree-width. J Algorithms"},{"key":"5_CR34","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0205021","volume":"5","author":"D Rose","year":"1976","unstructured":"Rose D, Tarjan E, Lueker G (1976) Algorithmic aspects of vertex elimination on graphs. SIAM J Comput 5:146\u2013160","journal-title":"SIAM J Comput"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0305-0548(94)90059-0","volume":"21","author":"F Spieksma","year":"1994","unstructured":"Spieksma F (1994) A branch-and-bound algorithm for the two-dimensional vector packing problem. Comput Oper Res 21:19\u201325","journal-title":"Comput Oper Res"},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"J Val\u00e9rio de Carvalho","year":"1999","unstructured":"Val\u00e9rio de Carvalho J (1999) Exact solution of bin packing problems using column generation and branch-and-bound. Ann Oper Res 86:629\u2013659","journal-title":"Ann Oper Res"},{"key":"5_CR37","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1023\/A:1013733421344","volume":"21","author":"J Val\u00e9rio de Carvalho","year":"2002","unstructured":"Val\u00e9rio de Carvalho J (2002) A note on branch-and-price algorithms for the one-dimensional cutting stock problems. Comput Optim Appl 21:339\u2013340","journal-title":"Comput Optim Appl"},{"key":"5_CR38","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"P Vance","year":"1998","unstructured":"Vance P (1998) Branch-and-Price algorithms for the one-dimensional cutting stock problem. Comput Optim Appl 9:211\u2013228","journal-title":"Comput Optim Appl"},{"issue":"6","key":"5_CR39","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1287\/opre.48.6.915.12391","volume":"46","author":"F Vanderbeck","year":"2000","unstructured":"Vanderbeck F (2000) Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem. Oper Res 46(6):915\u2013926","journal-title":"Oper Res"}],"container-title":["EURO Advanced Tutorials on Operational Research","Dual-Feasible Functions for Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27604-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:14:50Z","timestamp":1559373290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27604-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319276021","9783319276045"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27604-5_5","relation":{},"ISSN":["2364-687X","2364-6888"],"issn-type":[{"type":"print","value":"2364-687X"},{"type":"electronic","value":"2364-6888"}],"subject":[],"published":{"date-parts":[[2016]]}}}