{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:27:16Z","timestamp":1725823636845},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662476710"},{"type":"electronic","value":"9783662476727"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47672-7_11","type":"book-chapter","created":{"date-parts":[[2015,6,19]],"date-time":"2015-06-19T06:07:39Z","timestamp":1434694059000},"page":"129-142","source":"Crossref","is-referenced-by-count":0,"title":["Solving Linear Programming with Constraints Unknown"],"prefix":"10.1007","author":[{"given":"Xiaohui","family":"Bei","sequence":"first","affiliation":[]},{"given":"Ning","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Shengyu","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,20]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00181470","volume":"19","author":"PF Ash","year":"1985","unstructured":"Ash, P.F., Bolker, E.D.: Recognizing dirichlet tessellations. Geometriae Dedicata 19(2), 175\u2013206 (1985)","journal-title":"Geometriae Dedicata"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Zhang, S.: On the complexity of trial and error. In: Proceedings of the 45th ACM Symposium on Theory of Computing, pp. 31\u201340 (2013)","DOI":"10.1145\/2488608.2488613"},{"key":"11_CR3","unstructured":"Bei, X., Chen, N., Zhang, S.: Solving linear programming with constraints unknown (2013). arXiv:1304.1247"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1561\/1300000009","volume":"2","author":"M Chiang","year":"2007","unstructured":"Chiang, M., Hande, P., Lan, T., Tan, C.-W.: Power control in wireless cellular networks. Foundations and Trends in Networking 2(4), 381\u2013533 (2007)","journal-title":"Foundations and Trends in Networking"},{"issue":"2","key":"11_CR5","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/201019.201036","volume":"42","author":"KL Clarkson","year":"1995","unstructured":"Clarkson, K.L.: Las vegas algorithms for linear and integer programming when the dimension is small. Journal of the ACM 42(2), 488\u2013499 (1995)","journal-title":"Journal of the ACM"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Doherty, L., Pister, K., Ghaoui, L.E.: Convex position estimation in wireless sensor networks. In: Proceedings of the Twentieth IEEE Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1655\u20131663 (2001)","DOI":"10.1109\/INFCOM.2001.916662"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Dyer, M., Megiddo, N., Welzl, E.: Linear programming. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry. CRC Press (2004)","DOI":"10.1201\/9781420035315.pt6"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"ME Dyer","year":"1986","unstructured":"Dyer, M.E.: On a multidimensional search technique and its application to the euclidean one-centre problem. SIAM Journal on Computing 15(3), 725\u2013738 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/25.260747","volume":"42","author":"GJ Foschini","year":"1993","unstructured":"Foschini, G.J., Miljanic, Z.: A simple distributed autonomous power control algorithm and its convergence. IEEE Transactions on Vehicular Technology 42(3), 641\u2013646 (1993)","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Gentile, C.: Distributed sensor location through linear programming with triangle inequality constraints. In: Proceedings of IEEE Conference on Communications, pp. 3192\u20133196 (2005)","DOI":"10.1109\/ICC.2006.255710"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric methods in combinatorial optimization. In: Progress in Combinatorial Optimization, pp. 167\u2013183 (1984)","DOI":"10.1016\/B978-0-12-566780-7.50016-7"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1988)","DOI":"10.1007\/978-3-642-97881-4"},{"issue":"4","key":"11_CR13","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1287\/ijoc.4.4.369","volume":"4","author":"D Hartvigsen","year":"1992","unstructured":"Hartvigsen, D.: Recognizing voronoi diagrams with linear programming. INFORMS Journal on Computing 4(4), 369\u2013374 (1992)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1007\/978-3-662-43948-7_55","volume-title":"Automata, Languages, and Programming","author":"G Ivanyos","year":"2014","unstructured":"Ivanyos, G., Kulkarni, R., Qiao, Y., Santha, M., Sundaram, A.: On the complexity of trial and error for constraint satisfaction problems. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 663\u2013675. Springer, Heidelberg (2014)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Kalai, G.: A subexponential randomized simplem algorithm. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 475\u2013482 (1992)","DOI":"10.1145\/129712.129759"},{"key":"11_CR16","first-page":"1093","volume":"244","author":"L Khachiyan","year":"1979","unstructured":"Khachiyan, L.: A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR 244, 1093\u20131096 (1979)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Kovalev, M.: A property of convex sets and its application. Matematicheskie Zametki, pp. 89\u201399. English translation: Mathematical Notes, 44, 537\u2013543 (1988)","DOI":"10.1007\/BF01158120"},{"issue":"4\/5","key":"11_CR18","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BF01940877","volume":"16","author":"J Matousek","year":"1996","unstructured":"Matousek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16(4\/5), 498\u2013516 (1996)","journal-title":"Algorithmica"},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. Journal of the ACM 31(1), 114\u2013127 (1984)","journal-title":"Journal of the ACM"},{"key":"11_CR20","unstructured":"Montgomery, D.: Design and Analysis of Experiments, 7 edn. Wiley (2008)"},{"key":"11_CR21","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications (1998)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Linear programming without the matrix. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 121\u2013129 (1993)","DOI":"10.1145\/167088.167127"},{"issue":"4","key":"11_CR23","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1137\/12086279X","volume":"22","author":"IO Ryzhov","year":"2012","unstructured":"Ryzhov, I.O., Powell, W.B.: Information collection for linear programs with uncertain objective coefficients. SIAM Journal on Optimization 22(4), 1344\u20131368 (2012)","journal-title":"SIAM Journal on Optimization"},{"key":"11_CR24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.7146\/math.scand.a-10390","volume":"2","author":"L Sandgren","year":"1954","unstructured":"Sandgren, L.: On convex cones. Mathematica Scandinavica 2, 19\u201328 (1954)","journal-title":"Mathematica Scandinavica"},{"key":"11_CR25","unstructured":"Yudin, D.B., Nemirovskii, A.S.: Informational complexity and efficient methods for the solution of convex extremal problems. Ekonomika i Matematicheskie Metody, 12, 357\u2013369 (1976). English translation: Matekon 13(3), 25\u201345 (1977)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47672-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,27]],"date-time":"2019-08-27T05:43:03Z","timestamp":1566884583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47672-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662476710","9783662476727"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47672-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}