FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4254758512> ?p ?o ?g. }

• W4254758512 endingPage "359" @default.
• W4254758512 startingPage "355" @default.
• W4254758512 abstract "Free Access Bibliography Michael H. Veatch, Michael H. Veatch Gordon CollegeSearch for more papers by this author Book Author(s):Michael H. Veatch, Michael H. Veatch Gordon CollegeSearch for more papers by this author First published: 03 February 2021 https://doi.org/10.1002/9781119664079.biblio AboutPDFPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShareShare a linkShare onFacebookTwitterLinked InRedditWechat References O. Aarvik and P. Randolph . The application of linear programming to the determination of transmission fees in an electrical power network . Interfaces , 6 ( 1 ): 47 – 49 , 1975 . R.K. Ahuja , T.L. Magnanti , and J.B. Orlin . Network Flows . Prentice Hall , Englewood Cliffs, NJ , 1993 . S.C. Albright and W.L. Winston . Spreadsheet Modeling and Applications: Essentials of Practical Management Science . South-Western Pub , Mason, OH , 2005 . E.D. Andersen and K.D. Andersen . The MOSEK interior point optimizer for linear programming: an implementation of the homogeneous algorithm . In H. Frenk , K. Roos , T. Terlaky , S. Zhang , editors, High Performance Optimization , pages 197 – 232 . Springer , New York , 2000 . J.M. Andrews , V.F. Farias , A.I. Khojandi , and C.M. Yan . Primal–dual algorithms for order fulfillment at Urban Outfitters, Inc . INFORMS Journal on Applied Analytics , 49 ( 5 ): 355 – 370 , 2019 . D.L. Applegate , R.E. Bixby , V. Chvátal , and W.J. Cook . The Traveling Salesman Problem: A Computational Study . Princeton University Press , Princeton, NJ , 2006 . F. Babonneau , G. Corcos , L. Drouet , and J.P. Vial . NeatWork: a tool for the design of gravity-driven water distribution systems for poor rural communities . INFORMS Journal on Applied Analytics , 49 ( 2 ). 129 – 136 , 2019 . C. Barnhart , P. Belobaba , and A.R. Odoni . Applications of operations research in the air transport industry . Transportation Science , 37 ( 4 ): 368 – 391 , 2003 . E.M.L. Beale . Cycling in the dual simplex algorithm . Naval Research Logistics Quarterly , 2 ( 4 ): 269 – 275 , 1955 . J.C. Bean , C.E. Noon , S.M. Ryan , and G.J. Salton . Selecting tenants in a shopping mall . Interfaces , 18 ( 2 ): 1 – 9 , 1988 . J.E. Beasley , M. Krishnamoorthy , Y.M. Sharaiha , and D. Abramson . Scheduling aircraft landings-the static case . Transportation Science , 34 ( 2 ): 180 – 197 , 2000 . R. Bellman . On a routing problem . Quarterly of Applied Mathematics , 16 ( 1 ): 87 – 90 , 1958 . R.E. Bellman and S.E. Dreyfus . Applied Dynamic Programming . Princeton University Press , Princeton, NJ , 2015 . A. Ben-Tal , L. El Ghaoui , and A. Nemirovski . Robust Optimization . Princeton University Press , Princeton, NJ , 2009 . D.P. Bertsekas . Nonlinear Programming . Athena Scientific , Belmont, CA , 2nd edition, 1999 . D.P. Bertsekas . Dynamic Programming and Optimal Control , Volume 2 . Athena Scientific , Belmont, CA , 2007 . D.P. Bertsekas and J.N. Tsitsiklis . Parallel and Distributed Computation: Numerical Methods . Athena Scientific , Belmont, CA , 2015 . D. Bertsimas and J.N. Tsitsiklis . Introduction to Linear Optimization . Athena Scientific , Belmont, CA , 1997 . D. Bertsimas and R. Weismantel . Optimization Over Integers . Dynamic Ideas , Belmont, CA , 2005 . S. Bhulai , G. Koole , and A. Pot . Simple methods for shift scheduling in multiskill call centers . Manufacturing & Service Operations Management , 10 ( 3 ): 411 – 420 , 2008 . R.E. Bixby . Implementing the simplex method: the initial basis . ORSA Journal on Computing , 4 ( 3 ): 267 – 284 , 1992 . R.E. Bixby . A brief history of linear and mixed-integer programming computation . Documenta Mathematica , Extra Volume: ISMP : 107 – 121 , 2012 . R.G. Bland . New finite pivoting rules for the simplex method . Mathematics of Operations Research , 2 ( 2 ): 103 – 107 , 1977 . S. Boyd and L. Vandenberghe . Convex Optimization . Cambridge University Press , New York , 2004 . J.A. Carbajal , P. Williams , A. Popescu , and W. Chaar . Turner blazes a trail for audience targeting on television with operations research and advanced analytics . INFORMS Journal on Applied Analytics , 49 ( 1 ): 64 – 89 , 2019 . Y. Chen , P. Berkhin , B. Anderson , and N.R. Devanur . Real-time bidding algorithms for performance-based display ad allocation. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , pages 1307 – 1315 . ACM , 2011 . D.M. Chickering and D. Heckerman . Targeted advertising on the web with inventory management . Interfaces , 33 ( 5 ): 71 – 77 , 2003 . V. Chvátal . Edmonds polytopes and a hierarchy of combinatorial problems . Discrete Mathematics , 4 ( 4 ): 305 – 337 , 1973 . V. Chvátal . Linear Programming . Macmillan , New York , 1983 . F.E. Clark . Remark on the constraint sets in linear programming . The American Mathematical Monthly , 68 ( 4 ): 351 – 352 , 1961 . M.C. Cohen and G. Perakis . Optimizing promotions for multiple items in supermarkets . In S. Ray , S. Yin , editors, Channel Strategies and Marketing Mix in a Connected World , pages 71 – 97 . Springer , 2020 . M.C. Cohen , N.H.Z. Leung , K. Panchamgam et al. The impact of linear optimization on promotion planning . Operations Research , 65 ( 2 ): 446 – 468 , 2017 . G. Cornuéjols . Revival of the Gomory cuts in the 1990's . Annals of Operations Research , 149 ( 1 ): 63 – 66 , 2007 . G.B. Dantzig . Maximization of a linear function of variables subject to linear inequalities . In T.C. Koopmans , editor, Activity Analysis of Production and Allocation , pages 339 – 347 . Wiley , New York , 1951 . G.B. Dantzig . Linear Programming and Extensions . Princeton University Press , Princeton, NJ , 1963 . G.B. Dantzig . The diet problem . Interfaces , 20 ( 4 ): 43 – 47 , 1990 . D.P. De Farias and B. Van Roy . The linear programming approach to approximate dynamic programming . Operations Research , 51 ( 6 ): 850 – 865 , 2003 . D.P. De Farias and B. Van Roy . On constraint sampling in the linear programming approach to approximate dynamic programming . Mathematics of Operations Research , 29 ( 3 ): 462 – 478 , 2004 . D. Den Hertog . Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity . Springer Science & Business Media , Berlin , 2012 . E.W. Dijkstra . A note on two problems in connexion with graphs . Numerische Mathematik , 1 ( 1 ): 269 – 271 , 1959 . L.R. Ford Jr. Network flow theory . Technical report P-923, Rand Corp, Santa Monica, CA, 1956 . J.J. Forrest and D. Goldfarb . Steepest-edge simplex algorithms for linear programming . Mathematical Programming , 57 ( 1–3 ): 341 – 374 , 1992 . D. Freund , S.G. Henderson , E. O'Mahony , and D.B. Shmoys . Analytics and bikes: riding tandem with Motivate to improve mobility . INFORMS Journal on Applied Analytics , 49 ( 5 ): 310 – 323 , 2019 . D. Goldfarb and J.K. Reid . A practicable steepest-edge simplex algorithm . Mathematical Programming , 12 ( 1 ): 361 – 371 , 1977 . R.E. Gomory . Outline of an algorithm for integer solutions to linear programs . Bulletin of the American Mathematical Society , 64 ( 5 ): 275 – 278 , 2010 . P.M.J. Harris . Pivot selection methods of the devex LP code . Mathematical Programming , 5 ( 1 ): 1 – 28 , 1973 . M. Held and R.M. Karp . The traveling-salesman problem and minimum spanning trees . Operations Research , 18 ( 6 ): 1138 – 1162 , 1970 . M. Held and R.M. Karp . The traveling-salesman problem and minimum spanning trees: Part II . Mathematical Programming , 1 ( 1 ): 6 – 25 , 1971 . A.J. Hoffman and J.B. Kruskal . Integral boundary points of convex polyhedra . In H.W. Kuhn and A.W. Tucker , editors, Linear Inequalities and Related Systems , pages 223 – 246 . Princeton University Press , Princeton, NJ , 1956 . M.P. Johnson . Community-based operations research: introduction, theory, and applications . In M.P. Johnson , editor, Community-Based Operations Research , pages 3 – 36 . Springer , New York , 2012 . E.D. Kim and F. Santos . An update on the Hirsch conjecture . Jahresbericht der Deutschen Mathematiker-Vereinigung , 112 ( 2 ): 73 – 98 , 2010 . V. Klee and G.J. Minty . How good is the simplex algorithm . Inequalities , 3 ( 3 ): 159 – 175 , 1972 . M. Kojima , N. Megiddo , and S. Mizuno . A primal-dual infeasible-interior-point algorithm for linear programming . Mathematical Programming , 61 ( 1–3 ): 263 – 280 , 1993 . H.W Kuhn . Nonlinear programming: a historical view . In R.W. Cottle and C.E. Lemke , editors, Nonlinear Programming, SIAM-AMS Proceedings , Volume IX , pages 1 – 26 . American Mathematical Society , Providence, RI , 1976 . H.W. Kuhn and A.W. Tucker . Nonlinear programming . In J. Neyman , editor, Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability , pages 481 – 492 . University of California Press , Berkeley, CA , 1951 . L.M. Lancaster . The evolution of the diet model in managing food systems . Interfaces , 22 ( 5 ): 59 – 68 , 1992 . E.L. Lawler , J.K. Lenstra , A.H.G. Rinnooy Kan , and D.B. Shmoys . The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization . Wiley , New York , 1985 . D.G. Luenberger and Y. Ye . Linear and Nonlinear Programming . Springer , Reading, PA , 2016 . I.J. Lustig , R.E. Marsten , and D.F. Shanno . Interior point methods for linear programming: computational state of the art . ORSA Journal on Computing , 6 ( 1 ): 1 – 14 , 1994 . H. Marchand and L.A. Wolsey . Aggregation and mixed integer rounding to solve MIPs . Operations Research , 49 ( 3 ): 363 – 371 , 2001 . C.H. Martin , D.C. Dent , and J.C. Eckhart . Integrated production, distribution, and inventory planning at Libbey-Owens-Ford . Interfaces , 23 ( 3 ): 68 – 78 , 1993 . C.E. Miller , A.W. Tucker , and R.A. Zemlin . Integer programming formulation of traveling salesman problems . Journal of the ACM , 7 ( 4 ): 326 – 329 , 1960 . J. Moline , J. Goentzel , and E. Gralla . Approaches for locating and staffing FEMA's disaster recovery centers . Decision Sciences , 50 ( 5 ): 917 – 947 , 2019 . G.L. Nemhauser and L.A. Wolsey . Integer and Combinatorial Optimization . Wiley , New York , 1988 . C.H. Papadimitriou and K. Steiglitz . Combinatorial Optimization . Prentice Hall , Englewood Cliffs, NJ , 1982 . S.M. Pollock and M.D. Maltz . Operations research in the public sector: an introduction and a brief history . Operations Research and the Public Sector , 6 : 1 – 22 , 1994 . M.L. Puterman . Markov Decision Processes: Discrete Stochastic Dynamic Programming . Wiley , Hoboken, NJ , 2014 . D.J. Rader . Deterministic Operations Research: Models and Methods in Linear Optimization . Wiley , New York , 2010 . W.A. Robbins , and N. Tuntiwongpiboom . Linear programming a useful tool in case-mix management . Healthcare Financial Management: Journal of the Healthcare Financial Management Association , 40 ( 6 ). 114 , 1986 . A. Schrijver . Theory of Linear and Integer Programming . Wiley , New York , 1986 . P.J. Schweitzer and A. Seidmann . Generalized polynomial approximations in Markovian decision processes . Journal of Mathematical Analysis and Applications , 110 ( 2 ): 568 – 582 , 1985 . M. Udell and O. Toole . Optimal design of efficient rooftop photovoltaic arrays . INFORMS Journal on Applied Analytics , 49 ( 4 ): 281 – 294 , 2019 . M.H. Veatch . Approximate linear programming for average cost MDPs . Mathematics of Operations Research , 38 ( 3 ): 535 – 544 , 2013 . L.A. Wolsey and G.L. Nemhauser . Integer and Combinatorial Optimization . Wiley , Hoboken, NJ , 2014 . Y. Ye , M.J. Todd , and S. Mizuno . An O(SQRT nL)-iteration homogeneous and self-dual linear programming algorithm . Mathematics of Operations Research , 19 ( 1 ): 53 – 67 , 1994 . Linear and Convex Optimization: A Mathematical Approach ReferencesRelatedInformation" @default.
• W4254758512 created "2022-05-12" @default.
• W4254758512 date "2021-02-03" @default.
• W4254758512 modified "2023-09-27" @default.
• W4254758512 title "Bibliography" @default.
• W4254758512 cites W1560960960 @default.
• W4254758512 cites W1596877211 @default.
• W4254758512 cites W1745373831 @default.
• W4254758512 cites W2003856348 @default.
• W4254758512 cites W2004747092 @default.
• W4254758512 cites W2009683816 @default.
• W4254758512 cites W2009803313 @default.
• W4254758512 cites W2011959190 @default.
• W4254758512 cites W2013327579 @default.
• W4254758512 cites W2016246421 @default.
• W4254758512 cites W2016853911 @default.
• W4254758512 cites W2022004439 @default.
• W4254758512 cites W2027563840 @default.
• W4254758512 cites W2033033900 @default.
• W4254758512 cites W2033798573 @default.
• W4254758512 cites W2040766536 @default.
• W4254758512 cites W2049287714 @default.
• W4254758512 cites W2051178883 @default.
• W4254758512 cites W2058748455 @default.
• W4254758512 cites W2079987483 @default.
• W4254758512 cites W2082824470 @default.
• W4254758512 cites W2089389443 @default.
• W4254758512 cites W2093547978 @default.
• W4254758512 cites W2093903024 @default.
• W4254758512 cites W2102922379 @default.
• W4254758512 cites W2106614985 @default.
• W4254758512 cites W2145243417 @default.
• W4254758512 cites W2149464156 @default.
• W4254758512 cites W2152404388 @default.
• W4254758512 cites W2158479468 @default.
• W4254758512 cites W2169528473 @default.
• W4254758512 cites W2227557434 @default.
• W4254758512 cites W2317751094 @default.
• W4254758512 cites W2505968561 @default.
• W4254758512 cites W2769698454 @default.
• W4254758512 cites W2917381464 @default.
• W4254758512 cites W2922861820 @default.
• W4254758512 cites W2926511613 @default.
• W4254758512 cites W2966665425 @default.
• W4254758512 cites W2981566419 @default.
• W4254758512 cites W2982061585 @default.
• W4254758512 cites W3099025364 @default.
• W4254758512 cites W3122449708 @default.
• W4254758512 cites W3124498598 @default.
• W4254758512 cites W4250589301 @default.
• W4254758512 cites W4251616545 @default.
• W4254758512 cites W4292230442 @default.
• W4254758512 cites W4301216918 @default.
• W4254758512 doi "https://doi.org/10.1002/9781119664079.biblio" @default.
• W4254758512 hasPublicationYear "2021" @default.
• W4254758512 type Work @default.
• W4254758512 citedByCount "0" @default.
• W4254758512 crossrefType "other" @default.
• W4254758512 hasConcept C161191863 @default.
• W4254758512 hasConcept C41008148 @default.
• W4254758512 hasConcept C97002063 @default.
• W4254758512 hasConceptScore W4254758512C161191863 @default.
• W4254758512 hasConceptScore W4254758512C41008148 @default.
• W4254758512 hasConceptScore W4254758512C97002063 @default.
• W4254758512 hasLocation W42547585121 @default.
• W4254758512 hasOpenAccess W4254758512 @default.
• W4254758512 hasPrimaryLocation W42547585121 @default.
• W4254758512 hasRelatedWork W2330962162 @default.
• W4254758512 hasRelatedWork W2370620280 @default.
• W4254758512 hasRelatedWork W2385673297 @default.
• W4254758512 hasRelatedWork W2748952813 @default.
• W4254758512 hasRelatedWork W2899084033 @default.
• W4254758512 hasRelatedWork W2916246972 @default.
• W4254758512 hasRelatedWork W3132798417 @default.
• W4254758512 hasRelatedWork W4205608827 @default.
• W4254758512 hasRelatedWork W4210676361 @default.
• W4254758512 hasRelatedWork W4231885144 @default.
• W4254758512 isParatext "false" @default.
• W4254758512 isRetracted "false" @default.
• W4254758512 workType "other" @default.