Allende, Sira; Bouza, Carlos; Li, Marja Optimal consensus ranking using {SLS}: an approach and an application. (English) Zbl 1314.90091 Rev. Invest. Oper. 34, No. 1, 58-74 (2013). MSC: 90C59 90C60 PDFBibTeX XMLCite \textit{S. Allende} et al., Rev. Invest. Oper. 34, No. 1, 58--74 (2013; Zbl 1314.90091)
Ndiaye, Babacar M.; Lavallée, Ivan; Seck, Diaraf Solving worrying simplex’s instances in polynomial time. (English) Zbl 1321.90083 Mong. Math. J. 17, 4-26 (2013). MSC: 90C05 90C60 PDFBibTeX XMLCite \textit{B. M. Ndiaye} et al., Mong. Math. J. 17, 4--26 (2013; Zbl 1321.90083)
Li, Dan; Terlaky, Tamás The duality between the perceptron algorithm and the von Neumann algorithm. (English) Zbl 1305.49045 Zuluaga, Luis F. (ed.) et al., Modeling and optimization. Theory and applications. Selected contributions from the MOPTA 2012 conference, Bethlehem, PA, USA, July 30 – August 1, 2012. New York, NY: Springer (ISBN 978-1-4614-8986-3/hbk; 978-1-4614-8987-0/ebook). Springer Proceedings in Mathematics & Statistics 62, 113-136 (2013). MSC: 49N15 90C05 90C60 68Q25 PDFBibTeX XMLCite \textit{D. Li} and \textit{T. Terlaky}, Springer Proc. Math. Stat. 62, 113--136 (2013; Zbl 1305.49045) Full Text: DOI
Mikhailyuk, V. A.; Lishchuk, N. V. Sensitivity analysis of the knapsack problem: a negative result. (English. Russian original) Zbl 1306.90133 Cybern. Syst. Anal. 49, No. 2, 201-204 (2013); translation from Kibern. Sist. Anal. 2013, No. 2, 48-51 (2013). MSC: 90C27 90C31 90C60 PDFBibTeX XMLCite \textit{V. A. Mikhailyuk} and \textit{N. V. Lishchuk}, Cybern. Syst. Anal. 49, No. 2, 201--204 (2013; Zbl 1306.90133); translation from Kibern. Sist. Anal. 2013, No. 2, 48--51 (2013) Full Text: DOI
Bampis, Evripidis; Letsios, Dimitrios; Lucarelli, Giorgio; Markakis, Evangelos; Milis, Ioannis On multiprocessor temperature-aware scheduling problems. (English) Zbl 1297.68037 J. Sched. 16, No. 5, 529-538 (2013). MSC: 68M20 68W25 90B35 90C60 PDFBibTeX XMLCite \textit{E. Bampis} et al., J. Sched. 16, No. 5, 529--538 (2013; Zbl 1297.68037) Full Text: DOI Link
Braune, Roland; Zäpfel, Günther; Affenzeller, Michael Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation. (English) Zbl 1297.90034 J. Sched. 16, No. 5, 495-518 (2013). MSC: 90B35 90C60 68Q25 68W25 90C11 90C59 PDFBibTeX XMLCite \textit{R. Braune} et al., J. Sched. 16, No. 5, 495--518 (2013; Zbl 1297.90034) Full Text: DOI
Bock, Stefan; Klamroth, Kathrin Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions. (English) Zbl 1297.90030 J. Sched. 16, No. 5, 479-494 (2013). MSC: 90B35 90C60 68M20 90C39 PDFBibTeX XMLCite \textit{S. Bock} and \textit{K. Klamroth}, J. Sched. 16, No. 5, 479--494 (2013; Zbl 1297.90030) Full Text: DOI
Prot, D.; Bellenguez-Morineau, O.; Lahlou, C. A note on the paper “Minimizing total tardiness on parallel machines with preemptions”. (English) Zbl 1391.90304 J. Sched. 16, No. 4, 437-438 (2013). MSC: 90B35 68M20 68Q17 90C60 PDFBibTeX XMLCite \textit{D. Prot} et al., J. Sched. 16, No. 4, 437--438 (2013; Zbl 1391.90304) Full Text: DOI
Elalouf, Amir; Levner, Eugene; Tang, Huajun An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem. (English) Zbl 1297.90039 J. Sched. 16, No. 4, 429-435 (2013). MSC: 90B35 90C60 68M20 68W25 PDFBibTeX XMLCite \textit{A. Elalouf} et al., J. Sched. 16, No. 4, 429--435 (2013; Zbl 1297.90039) Full Text: DOI
Vakhania, Nodari A study of single-machine scheduling problem to maximize throughput. (English) Zbl 1297.90059 J. Sched. 16, No. 4, 395-403 (2013). MSC: 90B35 90C60 68M20 PDFBibTeX XMLCite \textit{N. Vakhania}, J. Sched. 16, No. 4, 395--403 (2013; Zbl 1297.90059) Full Text: DOI
Antoniadis, Antonios; Huang, Chien-Chung Non-preemptive speed scaling. (English) Zbl 1297.68036 J. Sched. 16, No. 4, 385-394 (2013). MSC: 68M20 68W25 90B35 90C60 PDFBibTeX XMLCite \textit{A. Antoniadis} and \textit{C.-C. Huang}, J. Sched. 16, No. 4, 385--394 (2013; Zbl 1297.68036) Full Text: DOI
Chung, Dae-Young; Choi, Byung-Cheon Outsourcing and scheduling for two-machine ordered flow shop scheduling problems. (English) Zbl 1292.90111 Eur. J. Oper. Res. 226, No. 1, 46-52 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{D.-Y. Chung} and \textit{B.-C. Choi}, Eur. J. Oper. Res. 226, No. 1, 46--52 (2013; Zbl 1292.90111) Full Text: DOI
Chen, Doron; Chen, Reuven Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem. (English) Zbl 1292.90159 Eur. J. Oper. Res. 225, No. 1, 36-43 (2013). MSC: 90B80 90C60 PDFBibTeX XMLCite \textit{D. Chen} and \textit{R. Chen}, Eur. J. Oper. Res. 225, No. 1, 36--43 (2013; Zbl 1292.90159) Full Text: DOI
Cassioli, A.; Chiavaioli, A.; Manes, C.; Sciandrone, M. An incremental least squares algorithm for large scale linear classification. (English) Zbl 1292.90198 Eur. J. Oper. Res. 224, No. 3, 560-565 (2013). MSC: 90C06 68T05 90C59 90C60 PDFBibTeX XMLCite \textit{A. Cassioli} et al., Eur. J. Oper. Res. 224, No. 3, 560--565 (2013; Zbl 1292.90198) Full Text: DOI
Brouer, Berit D.; Dirksen, Jakob; Pisinger, David; Plum, Christian E. M.; Vaaben, Bo The vessel schedule recovery problem (VSRP) – a MIP model for handling disruptions in liner shipping. (English) Zbl 1292.90182 Eur. J. Oper. Res. 224, No. 2, 362-374 (2013). MSC: 90B90 90C11 90C60 90C90 PDFBibTeX XMLCite \textit{B. D. Brouer} et al., Eur. J. Oper. Res. 224, No. 2, 362--374 (2013; Zbl 1292.90182) Full Text: DOI Link
Tatsumi, Keiji; Ibuki, Takeru; Tanino, Tetsuzo A chaotic particle swarm optimization exploiting a virtual quartic objective function based on the personal and global best solutions. (English) Zbl 1291.90328 Appl. Math. Comput. 219, No. 17, 8991-9011 (2013). MSC: 90C59 90C60 90C26 PDFBibTeX XMLCite \textit{K. Tatsumi} et al., Appl. Math. Comput. 219, No. 17, 8991--9011 (2013; Zbl 1291.90328) Full Text: DOI
Bazgan, Cristina; Toubaline, Sonia; Vanderpooten, Daniel Critical edges for the assignment problem: complexity and exact resolution. (English) Zbl 1287.90080 Oper. Res. Lett. 41, No. 6, 685-689 (2013). MSC: 90C35 90C60 05C78 PDFBibTeX XMLCite \textit{C. Bazgan} et al., Oper. Res. Lett. 41, No. 6, 685--689 (2013; Zbl 1287.90080) Full Text: DOI
Kasperski, Adam; Zieliński, Paweł Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion. (English) Zbl 1287.90056 Oper. Res. Lett. 41, No. 6, 639-643 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{A. Kasperski} and \textit{P. Zieliński}, Oper. Res. Lett. 41, No. 6, 639--643 (2013; Zbl 1287.90056) Full Text: DOI arXiv
Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. Uniqueness in quadratic and hyperbolic \(0-1\) programming problems. (English) Zbl 1287.90045 Oper. Res. Lett. 41, No. 6, 633-635 (2013). MSC: 90C20 90C27 90C60 PDFBibTeX XMLCite \textit{V. G. Deineko} et al., Oper. Res. Lett. 41, No. 6, 633--635 (2013; Zbl 1287.90045) Full Text: DOI arXiv
Tavares, Gabriela; Parpas, Panos On the information-based complexity of stochastic programming. (English) Zbl 1287.90044 Oper. Res. Lett. 41, No. 6, 622-626 (2013). MSC: 90C15 94A15 65C50 90C60 PDFBibTeX XMLCite \textit{G. Tavares} and \textit{P. Parpas}, Oper. Res. Lett. 41, No. 6, 622--626 (2013; Zbl 1287.90044) Full Text: DOI
Xu, Zhou; Wen, Qi Corrigendum to: “Approximation hardness of min-max tree covers”. (English) Zbl 1286.90133 Oper. Res. Lett. 41, No. 5, 563 (2013). MSC: 90C27 90C35 90C60 68Q17 05C85 PDFBibTeX XMLCite \textit{Z. Xu} and \textit{Q. Wen}, Oper. Res. Lett. 41, No. 5, 563 (2013; Zbl 1286.90133) Full Text: DOI
Wan, Long; Yuan, Jinjiang Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. (English) Zbl 1286.90068 Oper. Res. Lett. 41, No. 4, 363-365 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{L. Wan} and \textit{J. Yuan}, Oper. Res. Lett. 41, No. 4, 363--365 (2013; Zbl 1286.90068) Full Text: DOI
Pokutta, Sebastian; Van Vyve, Mathieu A note on the extension complexity of the knapsack polytope. (English) Zbl 1286.90168 Oper. Res. Lett. 41, No. 4, 347-350 (2013). MSC: 90C57 90C60 90C27 PDFBibTeX XMLCite \textit{S. Pokutta} and \textit{M. Van Vyve}, Oper. Res. Lett. 41, No. 4, 347--350 (2013; Zbl 1286.90168) Full Text: DOI
Gouveia, Luis; Salazar-González, Juan-José Polynomial-time separation of enhanced reverse multistar inequalities. (English) Zbl 1286.90017 Oper. Res. Lett. 41, No. 3, 294-297 (2013). MSC: 90B06 90B10 90C60 90C35 PDFBibTeX XMLCite \textit{L. Gouveia} and \textit{J.-J. Salazar-González}, Oper. Res. Lett. 41, No. 3, 294--297 (2013; Zbl 1286.90017) Full Text: DOI
Liu, Yong-Jin; Wang, Shiyun; Sun, Juhe Finding the projection onto the intersection of a closed half-space and a variable box. (English) Zbl 1286.90105 Oper. Res. Lett. 41, No. 3, 259-264 (2013). MSC: 90C20 90C60 PDFBibTeX XMLCite \textit{Y.-J. Liu} et al., Oper. Res. Lett. 41, No. 3, 259--264 (2013; Zbl 1286.90105) Full Text: DOI
Feinberg, Eugene A.; Huang, Jefferson Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems. (English) Zbl 1286.90162 Oper. Res. Lett. 41, No. 3, 249-251 (2013). MSC: 90C40 90C60 90C05 PDFBibTeX XMLCite \textit{E. A. Feinberg} and \textit{J. Huang}, Oper. Res. Lett. 41, No. 3, 249--251 (2013; Zbl 1286.90162) Full Text: DOI
Sun, Lin-Hui; Cui, Kai; Chen, Ju-Hong; Wang, Jun; He, Xian-Chen Some results of the worst-case analysis for flow shop scheduling with a learning effect. (English) Zbl 1286.90067 Ann. Oper. Res. 211, 481-490 (2013). MSC: 90B35 90C59 90C60 PDFBibTeX XMLCite \textit{L.-H. Sun} et al., Ann. Oper. Res. 211, 481--490 (2013; Zbl 1286.90067) Full Text: DOI
Oulamara, Ammar; Rebaine, Djamal; Serairi, Mehdi Scheduling the two-machine open shop problem under resource constraints for setting the jobs. (English) Zbl 1286.90064 Ann. Oper. Res. 211, 333-356 (2013). MSC: 90B35 90C59 90C60 PDFBibTeX XMLCite \textit{A. Oulamara} et al., Ann. Oper. Res. 211, 333--356 (2013; Zbl 1286.90064) Full Text: DOI
Ren, Jianfeng; Du, Donglei; Xu, Dachuan The complexity of two supply chain scheduling problems. (English) Zbl 1285.90009 Inf. Process. Lett. 113, No. 17, 609-612 (2013). MSC: 90B35 68Q17 90C60 90B06 PDFBibTeX XMLCite \textit{J. Ren} et al., Inf. Process. Lett. 113, No. 17, 609--612 (2013; Zbl 1285.90009) Full Text: DOI
Gonzaga, Clóvis C.; Karas, Elizabeth W.; Rossetto, Diane R. An optimal algorithm for constrained differentiable convex optimization. (English) Zbl 1288.65087 SIAM J. Optim. 23, No. 4, 1939-1955 (2013). Reviewer: Hang Lau (Montréal) MSC: 65K05 90C25 90C60 65Y20 PDFBibTeX XMLCite \textit{C. C. Gonzaga} et al., SIAM J. Optim. 23, No. 4, 1939--1955 (2013; Zbl 1288.65087) Full Text: DOI
Löwes, Benedikt; Giegerich, Robert Avoiding ambiguity and assessing uniqueness in minisatellite alignment. (English) Zbl 1281.90079 Beißbarth, Tim (ed.) et al., German conference on bioinformatics 2013, GCB’13, Göttingen, Germany, September 10–13, 2013. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-59-0). OASIcs – OpenAccess Series in Informatics 34, 110-124, electronic only (2013). MSC: 90C39 90C60 PDFBibTeX XMLCite \textit{B. Löwes} and \textit{R. Giegerich}, OASIcs -- OpenAccess Ser. Inform. 34, 110--124 (2013; Zbl 1281.90079) Full Text: DOI
Bulatov, Andrei A.; Dyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark; Mcquillan, Colin The expressibility of functions on the Boolean domain, with applications to counting CSPs. (English) Zbl 1281.68131 J. ACM 60, No. 5, Article No. 32, 36 p. (2013). MSC: 68Q25 68W25 90C60 PDFBibTeX XMLCite \textit{A. A. Bulatov} et al., J. ACM 60, No. 5, Article No. 32, 36 p. (2013; Zbl 1281.68131) Full Text: DOI arXiv
Fan, B. Q.; Cheng, T. C. E.; Li, S. S.; Feng, Q. Bounded parallel-batching scheduling with two competing agents. (English) Zbl 1280.90043 J. Sched. 16, No. 3, 261-271 (2013). MSC: 90B35 90C39 90C60 PDFBibTeX XMLCite \textit{B. Q. Fan} et al., J. Sched. 16, No. 3, 261--271 (2013; Zbl 1280.90043) Full Text: DOI
Boysen, Nils; Bock, Stefan; Fliedner, Malte Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity. (English) Zbl 1280.90032 J. Sched. 16, No. 2, 185-198 (2013). MSC: 90B35 90B05 90C60 PDFBibTeX XMLCite \textit{N. Boysen} et al., J. Sched. 16, No. 2, 185--198 (2013; Zbl 1280.90032) Full Text: DOI
Hildebrand, Roland A lower bound on the barrier parameter of barriers for convex cones. (English) Zbl 1282.90127 Math. Program. 142, No. 1-2 (A), 311-329 (2013). MSC: 90C25 90C60 PDFBibTeX XMLCite \textit{R. Hildebrand}, Math. Program. 142, No. 1--2 (A), 311--329 (2013; Zbl 1282.90127) Full Text: DOI HAL
Žilinskas, Antanas On the worst-case optimal multi-objective global optimization. (English) Zbl 1287.90063 Optim. Lett. 7, No. 8, 1921-1928 (2013). MSC: 90C29 90C60 90C26 PDFBibTeX XMLCite \textit{A. Žilinskas}, Optim. Lett. 7, No. 8, 1921--1928 (2013; Zbl 1287.90063) Full Text: DOI
Fonteneau, R.; Ernst, D.; Boigelot, B.; Louveaux, Q. Min max generalization for deterministic batch mode reinforcement learning: relaxation schemes. (English) Zbl 1284.49012 SIAM J. Control Optim. 51, No. 5, 3355-3385 (2013). Reviewer: Marius Iosifescu (Bucureşti) MSC: 49J35 49J45 90C47 68T05 90C26 90C60 PDFBibTeX XMLCite \textit{R. Fonteneau} et al., SIAM J. Control Optim. 51, No. 5, 3355--3385 (2013; Zbl 1284.49012) Full Text: DOI Link
Manthey, Bodo; Veenstra, Rianne Smoothed analysis of the 2-opt heuristic for the TSP: polynomial bounds for Gaussian noise. (English) Zbl 1407.90277 Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8283, 579-589 (2013). MSC: 90C27 68W40 90C59 90C60 PDFBibTeX XMLCite \textit{B. Manthey} and \textit{R. Veenstra}, Lect. Notes Comput. Sci. 8283, 579--589 (2013; Zbl 1407.90277) Full Text: DOI
Karpinski, Marek; Lampis, Michael; Schmied, Richard New inapproximability bounds for TSP. (English) Zbl 1328.68075 Cai, Leizhen (ed.) et al., Algorithms and computation. 24th international symposium, ISAAC 2013, Hong Kong, China, December 16–18, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-45029-7/pbk). Lecture Notes in Computer Science 8283, 568-578 (2013). MSC: 68Q17 90C27 90C60 PDFBibTeX XMLCite \textit{M. Karpinski} et al., Lect. Notes Comput. Sci. 8283, 568--578 (2013; Zbl 1328.68075) Full Text: DOI arXiv
Manyem, Prabhu Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap. (English) Zbl 1311.68073 Optimization 62, No. 9, 1227-1246 (2013). MSC: 68Q19 68Q17 68Q25 68T20 90C60 PDFBibTeX XMLCite \textit{P. Manyem}, Optimization 62, No. 9, 1227--1246 (2013; Zbl 1311.68073) Full Text: DOI
Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L. On the evaluation complexity of cubic regularization methods for potentially rank-deficient nonlinear least-squares problems and its relevance to constrained nonlinear optimization. (English) Zbl 1277.68092 SIAM J. Optim. 23, No. 3, 1553-1574 (2013). MSC: 68Q25 90C60 90C30 90C26 65K05 PDFBibTeX XMLCite \textit{C. Cartis} et al., SIAM J. Optim. 23, No. 3, 1553--1574 (2013; Zbl 1277.68092) Full Text: DOI Link
Cao, Zhigang; Yang, Xiaoguang A note on anti-coordination and social interactions. (English) Zbl 1282.90148 J. Comb. Optim. 26, No. 4, 811-818 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{Z. Cao} and \textit{X. Yang}, J. Comb. Optim. 26, No. 4, 811--818 (2013; Zbl 1282.90148) Full Text: DOI arXiv
Li, Rongheng; Yang, Liying; He, Xiaoqiong; Chen, Qiang; Cheng, Xiayan Semi-online scheduling for jobs with release times. (English) Zbl 1282.90074 J. Comb. Optim. 26, No. 3, 448-464 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{R. Li} et al., J. Comb. Optim. 26, No. 3, 448--464 (2013; Zbl 1282.90074) Full Text: DOI
Wu, Bang Ye Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs. (English) Zbl 1282.90223 J. Comb. Optim. 26, No. 3, 592-607 (2013). MSC: 90C35 90C27 90C60 PDFBibTeX XMLCite \textit{B. Y. Wu}, J. Comb. Optim. 26, No. 3, 592--607 (2013; Zbl 1282.90223) Full Text: DOI arXiv
Zhong, Weiya; Huo, Zhiming Single machine scheduling problems with subcontracting options. (English) Zbl 1282.90079 J. Comb. Optim. 26, No. 3, 489-498 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{W. Zhong} and \textit{Z. Huo}, J. Comb. Optim. 26, No. 3, 489--498 (2013; Zbl 1282.90079) Full Text: DOI
Santos, Francisco Rejoinder on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes. (English) Zbl 1311.52013 Top 21, No. 3, 482-484 (2013). MSC: 52B05 90C60 90C05 05E45 PDFBibTeX XMLCite \textit{F. Santos}, Top 21, No. 3, 482--484 (2013; Zbl 1311.52013) Full Text: DOI
De Loera, Jesús A. Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes. (English) Zbl 1311.52010 Top 21, No. 3, 474-481 (2013). MSC: 52B05 90C60 90C05 05E45 PDFBibTeX XMLCite \textit{J. A. De Loera}, Top 21, No. 3, 474--481 (2013; Zbl 1311.52010) Full Text: DOI
Hiriart-Urruty, Jean-Baptiste Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes. (English) Zbl 1311.52012 Top 21, No. 3, 472-473 (2013). MSC: 52B05 90C60 90C05 05E45 PDFBibTeX XMLCite \textit{J.-B. Hiriart-Urruty}, Top 21, No. 3, 472--473 (2013; Zbl 1311.52012) Full Text: DOI
Eisenbrand, Friedrich Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes. (English) Zbl 1311.52011 Top 21, No. 3, 468-471 (2013). MSC: 52B05 90C60 90C05 05E45 PDFBibTeX XMLCite \textit{F. Eisenbrand}, Top 21, No. 3, 468--471 (2013; Zbl 1311.52011) Full Text: DOI
Terlaky, Tamás Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes. (English) Zbl 1280.52012 Top 21, No. 3, 461-467 (2013). MSC: 52B05 90C60 90C05 PDFBibTeX XMLCite \textit{T. Terlaky}, Top 21, No. 3, 461--467 (2013; Zbl 1280.52012) Full Text: DOI
Santos, Francisco Recent progress on the combinatorial diameter of polytopes and simplicial complexes. (English) Zbl 1280.52011 Top 21, No. 3, 426-460 (2013). MSC: 52B05 90C60 90C05 05E45 PDFBibTeX XMLCite \textit{F. Santos}, Top 21, No. 3, 426--460 (2013; Zbl 1280.52011) Full Text: DOI arXiv
Jin, Qingwei; Tian, Ye; Deng, Zhibin; Fang, Shu-Cherng; Xing, Wenxun Exact computable representation of some second-order cone constrained quadratic programming problems. (English) Zbl 1277.90091 J. Oper. Res. Soc. China 1, No. 1, 107-134 (2013). MSC: 90C22 90C60 PDFBibTeX XMLCite \textit{Q. Jin} et al., J. Oper. Res. Soc. China 1, No. 1, 107--134 (2013; Zbl 1277.90091) Full Text: DOI
Nie, Jiawang An approximation bound analysis for Lasserre’s relaxation in multivariate polynomial optimization. (English) Zbl 1277.90157 J. Oper. Res. Soc. China 1, No. 3, 313-332 (2013). MSC: 90C60 90C22 PDFBibTeX XMLCite \textit{J. Nie}, J. Oper. Res. Soc. China 1, No. 3, 313--332 (2013; Zbl 1277.90157) Full Text: DOI
Shenmaier, V. V. Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center. (English. Russian original) Zbl 1275.90129 Dokl. Math. 87, No. 3, 342-344 (2013); translation from Dokl. Akad. Nauk. 450, No. 5, 522-524 (2013). MSC: 90C60 90C35 90C27 PDFBibTeX XMLCite \textit{V. V. Shenmaier}, Dokl. Math. 87, No. 3, 342--344 (2013; Zbl 1275.90129); translation from Dokl. Akad. Nauk. 450, No. 5, 522--524 (2013) Full Text: DOI
Dash, Sanjeeb; Günlük, Oktay On \(t\)-branch split cuts for mixed-integer programs. (English) Zbl 1280.90089 Math. Program. 141, No. 1-2 (A), 591-599 (2013). MSC: 90C11 90C60 PDFBibTeX XMLCite \textit{S. Dash} and \textit{O. Günlük}, Math. Program. 141, No. 1--2 (A), 591--599 (2013; Zbl 1280.90089) Full Text: DOI
Xiong, Yupei; Gulczynski, Damon; Kleitman, Daniel; Golden, Bruce; Wasil, Edward A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts. (English) Zbl 1280.90016 Optim. Lett. 7, No. 7, 1597-1609 (2013). MSC: 90B06 90C60 PDFBibTeX XMLCite \textit{Y. Xiong} et al., Optim. Lett. 7, No. 7, 1597--1609 (2013; Zbl 1280.90016) Full Text: DOI
Panchamgam, Kiran; Xiong, Yupei; Golden, Bruce; Dussault, Benjamin; Wasil, Edward The hierarchical traveling salesman problem. (English) Zbl 1280.90101 Optim. Lett. 7, No. 7, 1517-1524 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{K. Panchamgam} et al., Optim. Lett. 7, No. 7, 1517--1524 (2013; Zbl 1280.90101) Full Text: DOI
Park, Bum Hwan; Seo, Yong-Il; Hong, Sung-Pil; Rho, Hag-Lae Column generation approach to line planning with various halting patterns - application to the Korean high-speed railway. (English) Zbl 1273.90112 Asia-Pac. J. Oper. Res. 30, No. 4, Article ID 1350006, 19 p. (2013). MSC: 90B90 90C60 PDFBibTeX XMLCite \textit{B. H. Park} et al., Asia-Pac. J. Oper. Res. 30, No. 4, Article ID 1350006, 19 p. (2013; Zbl 1273.90112) Full Text: DOI
Dolgui, A.; Eremeev, A.; Kovalyov, M. Y.; Sigaev, V. Complexity of buffer capacity allocation problems for production lines with unreliable machines. (English) Zbl 1311.90195 J. Math. Model. Algorithms Oper. Res. 12, No. 2, 155-165 (2013). MSC: 90C60 90B30 90B25 PDFBibTeX XMLCite \textit{A. Dolgui} et al., J. Math. Model. Algorithms Oper. Res. 12, No. 2, 155--165 (2013; Zbl 1311.90195) Full Text: DOI
Hamacher, Horst W.; Heller, Stephanie; Rupp, Benjamin Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning. (English) Zbl 1272.90024 Ann. Oper. Res. 207, 161-180 (2013). MSC: 90B85 90C35 90C60 PDFBibTeX XMLCite \textit{H. W. Hamacher} et al., Ann. Oper. Res. 207, 161--180 (2013; Zbl 1272.90024) Full Text: DOI
Gafarov, Evgeny R.; Lazarev, Alexander A.; Werner, Frank Single machine total tardiness maximization problems: complexity and algorithms. (English) Zbl 1273.90079 Ann. Oper. Res. 207, 121-136 (2013). MSC: 90B35 90C60 90C39 PDFBibTeX XMLCite \textit{E. R. Gafarov} et al., Ann. Oper. Res. 207, 121--136 (2013; Zbl 1273.90079) Full Text: DOI
Janiak, Adam; Kovalyov, Mikhail Y.; Lichtenstein, Maciej Strong NP-hardness of scheduling problems with learning or aging effect. (English) Zbl 1309.90026 Ann. Oper. Res. 206, 577-583 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{A. Janiak} et al., Ann. Oper. Res. 206, 577--583 (2013; Zbl 1309.90026) Full Text: DOI
Bonizzoni, Paola; Della Vedova, Gianluca; Dondi, Riccardo; Pirola, Yuri Parameterized complexity of \(k\)-anonymity: hardness and tractability. (English) Zbl 1300.90033 J. Comb. Optim. 26, No. 1, 19-43 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{P. Bonizzoni} et al., J. Comb. Optim. 26, No. 1, 19--43 (2013; Zbl 1300.90033) Full Text: DOI
Pferschy, Ulrich; Schauer, Joachim The maximum flow problem with disjunctive constraints. (English) Zbl 1275.90120 J. Comb. Optim. 26, No. 1, 109-119 (2013). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{U. Pferschy} and \textit{J. Schauer}, J. Comb. Optim. 26, No. 1, 109--119 (2013; Zbl 1275.90120) Full Text: DOI
Bazgan, Cristina; Toubaline, Sonia; Vanderpooten, Daniel Critical edges/nodes for the minimum spanning tree problem: complexity and approximation. (English) Zbl 1275.90113 J. Comb. Optim. 26, No. 1, 178-189 (2013). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{C. Bazgan} et al., J. Comb. Optim. 26, No. 1, 178--189 (2013; Zbl 1275.90113) Full Text: DOI
Wu, Weiwei; Li, Minming; Chen, Enhong Optimal key tree structure for two-user replacement and deletion problems. (English) Zbl 1298.90090 J. Comb. Optim. 26, No. 1, 44-70 (2013). MSC: 90C27 90C35 90C60 PDFBibTeX XMLCite \textit{W. Wu} et al., J. Comb. Optim. 26, No. 1, 44--70 (2013; Zbl 1298.90090) Full Text: DOI
Polyakovskiy, Sergey; Spieksma, Frits C. R.; Woeginger, Gerhard J. The three-dimensional matching problem in kalmanson matrices. (English) Zbl 1275.90083 J. Comb. Optim. 26, No. 1, 1-9 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{S. Polyakovskiy} et al., J. Comb. Optim. 26, No. 1, 1--9 (2013; Zbl 1275.90083) Full Text: DOI
Gao, Jianjun; Li, Duan A polynomial case of the cardinality-constrained quadratic optimization problem. (English) Zbl 1296.90085 J. Glob. Optim. 56, No. 4, 1441-1455 (2013). MSC: 90C20 90C60 PDFBibTeX XMLCite \textit{J. Gao} and \textit{D. Li}, J. Glob. Optim. 56, No. 4, 1441--1455 (2013; Zbl 1296.90085) Full Text: DOI
Hochbaum, Dorit S.; Orlin, James B. Simplifications and speedups of the pseudoflow algorithm. (English) Zbl 1269.90129 Networks 61, No. 1, 40-57 (2013). MSC: 90C35 90C60 68P05 PDFBibTeX XMLCite \textit{D. S. Hochbaum} and \textit{J. B. Orlin}, Networks 61, No. 1, 40--57 (2013; Zbl 1269.90129) Full Text: DOI Link
Bateni, MohammadHossein; Chuzhoy, Julia Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems. (English) Zbl 1272.90064 Algorithmica 65, No. 3, 545-561 (2013). MSC: 90C27 90C59 90C60 PDFBibTeX XMLCite \textit{M. Bateni} and \textit{J. Chuzhoy}, Algorithmica 65, No. 3, 545--561 (2013; Zbl 1272.90064) Full Text: DOI
Eisenschmidt, Elke; Haus, Utz-Uwe A polynomial time approximation algorithm for the two-commodity splittable flow problem. (English) Zbl 1272.90104 Math. Methods Oper. Res. 77, No. 3, 381-391 (2013). MSC: 90C35 90C59 90C60 PDFBibTeX XMLCite \textit{E. Eisenschmidt} and \textit{U.-U. Haus}, Math. Methods Oper. Res. 77, No. 3, 381--391 (2013; Zbl 1272.90104) Full Text: DOI Link
Bürgy, Reinhard; Gröflin, Heinz Optimal job insertion in the no-wait job shop. (English) Zbl 1297.90189 J. Comb. Optim. 26, No. 2, 345-371 (2013). MSC: 90C60 90B35 PDFBibTeX XMLCite \textit{R. Bürgy} and \textit{H. Gröflin}, J. Comb. Optim. 26, No. 2, 345--371 (2013; Zbl 1297.90189) Full Text: DOI
Ju, Wenqi; Fan, Chenglin; Luo, Jun; Zhu, Binhai; Daescu, Ovidiu On some geometric problems of color-spanning sets. (English) Zbl 1275.90080 J. Comb. Optim. 26, No. 2, 266-283 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{W. Ju} et al., J. Comb. Optim. 26, No. 2, 266--283 (2013; Zbl 1275.90080) Full Text: DOI
Alfaki, Mohammed; Haugland, Dag Strong formulations for the pooling problem. (English) Zbl 1272.90054 J. Glob. Optim. 56, No. 3, 897-916 (2013). MSC: 90C26 90C60 PDFBibTeX XMLCite \textit{M. Alfaki} and \textit{D. Haugland}, J. Glob. Optim. 56, No. 3, 897--916 (2013; Zbl 1272.90054) Full Text: DOI Link
Dai, Yu-Hong (ed.); Sun, Wenyu (ed.); Tanino, Tetsuzo (ed.) Special issue: Selected papers based on the presentations at the 5th Sino-Japan optimization meeting, Beijing, China, September 26–29, 2011. (English) Zbl 1282.90007 Asia-Pac. J. Oper. Res. 30, No. 3, not consecutively paged (2013). MSC: 90-06 90C30 90C60 91A06 00B25 PDFBibTeX XML
Mladenovic, Nenad; Hansen, Pierre; Brimberg, Jack Sequential clustering with radius and split criteria. (English) Zbl 1267.90178 CEJOR, Cent. Eur. J. Oper. Res. 21, Suppl. 1, 95-115 (2013). MSC: 90C59 62H30 90C60 PDFBibTeX XMLCite \textit{N. Mladenovic} et al., CEJOR, Cent. Eur. J. Oper. Res. 21, 95--115 (2013; Zbl 1267.90178) Full Text: DOI
Kel’manov, A. V.; Romanchenko, S. M.; Khamidullin, S. A. Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence. (Russian) Zbl 1274.90517 Zh. Vychisl. Mat. Mat. Fiz. 53, No. 1, 143-153 (2013). Reviewer: Andrei Zemskov (Moskva) MSC: 90C60 90C20 68Q17 PDFBibTeX XMLCite \textit{A. V. Kel'manov} et al., Zh. Vychisl. Mat. Mat. Fiz. 53, No. 1, 143--153 (2013; Zbl 1274.90517) Full Text: DOI MNR
Fu, Ke; Miao, Zhaowei; Xu, Jiayan On planar medianoid competitive location problems with Manhattan distance. (English) Zbl 1267.90180 Asia-Pac. J. Oper. Res. 30, No. 2, Article ID 1250050, 13 p. (2013). MSC: 90C60 90C35 PDFBibTeX XMLCite \textit{K. Fu} et al., Asia-Pac. J. Oper. Res. 30, No. 2, Article ID 1250050, 13 p. (2013; Zbl 1267.90180) Full Text: DOI
Hochbaum, Dorit S. A polynomial time algorithm for Rayleigh ratio on discrete variables: replacing spectral techniques for expander ratio, normalized cut, and Cheeger constant. (English) Zbl 1267.90149 Oper. Res. 61, No. 1, 184-198 (2013). MSC: 90C32 90C60 PDFBibTeX XMLCite \textit{D. S. Hochbaum}, Oper. Res. 61, No. 1, 184--198 (2013; Zbl 1267.90149) Full Text: DOI Link
Li, Maoqin; Li, Shanlin; Yan, Hong Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm. (English) Zbl 1273.90081 Optim. Lett. 7, No. 5, 1017-1026 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{M. Li} et al., Optim. Lett. 7, No. 5, 1017--1026 (2013; Zbl 1273.90081) Full Text: DOI
Monteiro, Renato D. C.; Svaiter, Benar F. Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers. (English) Zbl 1267.90181 SIAM J. Optim. 23, No. 1, 475-507 (2013). MSC: 90C60 65K05 65K10 49M27 90C25 47H05 47N10 PDFBibTeX XMLCite \textit{R. D. C. Monteiro} and \textit{B. F. Svaiter}, SIAM J. Optim. 23, No. 1, 475--507 (2013; Zbl 1267.90181) Full Text: DOI Link
Zhang, Lipu; Bai, Yanqin; Xu, Yinghong A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function. (English) Zbl 1272.90053 Optim. Methods Softw. 28, No. 3, 619-639 (2013). MSC: 90C25 90C51 90C60 PDFBibTeX XMLCite \textit{L. Zhang} et al., Optim. Methods Softw. 28, No. 3, 619--639 (2013; Zbl 1272.90053) Full Text: DOI
Cartis, Coralia; Gould, Nicholas I. M.; Toint, Philippe L. A note about the complexity of minimizing Nesterov’s smooth Chebyshev-Rosenbrock function. (English) Zbl 1273.90199 Optim. Methods Softw. 28, No. 3, 451-457 (2013). MSC: 90C30 65K05 90C60 68Q25 PDFBibTeX XMLCite \textit{C. Cartis} et al., Optim. Methods Softw. 28, No. 3, 451--457 (2013; Zbl 1273.90199) Full Text: DOI
Liang, Hongyu The hardness and approximation of the star \(p\)-hub center problem. (English) Zbl 1270.90057 Oper. Res. Lett. 41, No. 2, 138-141 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{H. Liang}, Oper. Res. Lett. 41, No. 2, 138--141 (2013; Zbl 1270.90057) Full Text: DOI
Levi, Retsef; Yedidsion, Liron NP-hardness proof for the assembly problem with stationary setup and additive holding costs. (English) Zbl 1262.90197 Oper. Res. Lett. 41, No. 2, 134-137 (2013). MSC: 90C60 90B05 PDFBibTeX XMLCite \textit{R. Levi} and \textit{L. Yedidsion}, Oper. Res. Lett. 41, No. 2, 134--137 (2013; Zbl 1262.90197) Full Text: DOI
Shim, Sangho; Johnson, Ellis L. Cyclic group blocking polyhedra. (English) Zbl 1274.90239 Math. Program. 138, No. 1-2 (A), 273-307 (2013). Reviewer: Efstratios Rappos (Aubonne) MSC: 90C10 90C27 90C57 90C60 52B05 52B11 52B12 52B55 05C21 05C25 20C40 PDFBibTeX XMLCite \textit{S. Shim} and \textit{E. L. Johnson}, Math. Program. 138, No. 1--2 (A), 273--307 (2013; Zbl 1274.90239) Full Text: DOI
Gimadi, E. Kh.; Kurochkin, A. A. Uniform capacitated facility location problem with random input data. (English. Russian original) Zbl 1272.90022 J. Math. Sci., New York 188, No. 4, 359-377 (2013); translation from Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform. 11, No. 1, 15-34 (2011). MSC: 90B80 68W25 90C59 90C60 PDFBibTeX XMLCite \textit{E. Kh. Gimadi} and \textit{A. A. Kurochkin}, J. Math. Sci., New York 188, No. 4, 359--377 (2013; Zbl 1272.90022); translation from Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform. 11, No. 1, 15--34 (2011) Full Text: DOI
Polyak, Roman A.; Costa, James; Neyshabouri, Saba Dual fast projected gradient method for quadratic programming. (English) Zbl 1292.90224 Optim. Lett. 7, No. 4, 631-645 (2013). MSC: 90C20 90C52 90C60 PDFBibTeX XMLCite \textit{R. A. Polyak} et al., Optim. Lett. 7, No. 4, 631--645 (2013; Zbl 1292.90224) Full Text: DOI
Liu, Longcheng; Yao, Enyu Weighted inverse maximum perfect matching problems under the Hamming distance. (English) Zbl 1268.90116 J. Glob. Optim. 55, No. 3, 549-557 (2013). MSC: 90C35 90C60 PDFBibTeX XMLCite \textit{L. Liu} and \textit{E. Yao}, J. Glob. Optim. 55, No. 3, 549--557 (2013; Zbl 1268.90116) Full Text: DOI
Takaoka, Tadao A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time. (English) Zbl 1268.90072 J. Comb. Optim. 25, No. 2, 326-337 (2013). MSC: 90C27 90C35 90C60 PDFBibTeX XMLCite \textit{T. Takaoka}, J. Comb. Optim. 25, No. 2, 326--337 (2013; Zbl 1268.90072) Full Text: DOI
Karmakar, Arindam; Das, Sandip; Nandy, Subhas C.; Bhattacharya, Binay K. Some variations on constrained minimum enclosing circle problem. (English) Zbl 1288.90078 J. Comb. Optim. 25, No. 2, 176-190 (2013). MSC: 90C27 90C60 PDFBibTeX XMLCite \textit{A. Karmakar} et al., J. Comb. Optim. 25, No. 2, 176--190 (2013; Zbl 1288.90078) Full Text: DOI
Caprara, Alberto; Carvalho, Margarida; Lodi, Andrea; Woeginger, Gerhard J. A complexity and approximability study of the bilevel knapsack problem. (English) Zbl 1372.90088 Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 98-109 (2013). MSC: 90C27 68W25 90C60 91A65 PDFBibTeX XMLCite \textit{A. Caprara} et al., Lect. Notes Comput. Sci. 7801, 98--109 (2013; Zbl 1372.90088) Full Text: DOI
Ahmadi, Amir Ali; Olshevsky, Alex; Parrilo, Pablo A.; Tsitsiklis, John N. NP-hardness of deciding convexity of quartic polynomials and related problems. (English) Zbl 1274.90516 Math. Program. 137, No. 1-2 (A), 453-476 (2013). Reviewer: Do Van Luu (Hanoi) MSC: 90C60 90C25 68Q25 PDFBibTeX XMLCite \textit{A. A. Ahmadi} et al., Math. Program. 137, No. 1--2 (A), 453--476 (2013; Zbl 1274.90516) Full Text: DOI arXiv
Dobson, M. P.; Leoni, V.; Nasini, G. A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games. (English) Zbl 1258.91017 Discrete Optim. 10, No. 1, 54-60 (2013). MSC: 91A10 90C60 PDFBibTeX XMLCite \textit{M. P. Dobson} et al., Discrete Optim. 10, No. 1, 54--60 (2013; Zbl 1258.91017) Full Text: DOI
Rudek, Radosław A note on proving the strong NP-hardness of a scheduling problem with position dependent job processing times. (English) Zbl 1268.90021 Optim. Lett. 7, No. 3, 613-616 (2013). MSC: 90B35 90C60 PDFBibTeX XMLCite \textit{R. Rudek}, Optim. Lett. 7, No. 3, 613--616 (2013; Zbl 1268.90021) Full Text: DOI
Doerr, Benjamin; Kötzing, Timo; Lengler, Johannes; Winzen, Carola Black-box complexities of combinatorial problems. (English) Zbl 1259.68181 Theor. Comput. Sci. 471, 84-106 (2013). MSC: 68T20 90C27 90C60 PDFBibTeX XMLCite \textit{B. Doerr} et al., Theor. Comput. Sci. 471, 84--106 (2013; Zbl 1259.68181) Full Text: DOI arXiv
Di Gaspero, Luca (ed.); Schaerf, Andrea (ed.); Stützle, Thomas (ed.) Advances in metaheuristics. Contributions presented at the 9th metaheuristic international conference, Udine, Italy, July 25–28, 2011. (English) Zbl 1282.90008 Operations Research/Computer Science Interfaces Series 53. New York, NY: Springer (ISBN 978-1-4614-6321-4/hbk; 978-1-4614-6322-1/ebook). xiv, 183 p. (2013). MSC: 90-06 90C59 68T05 90C60 90B90 00B25 PDFBibTeX XMLCite \textit{L. Di Gaspero} (ed.) et al., Advances in metaheuristics. Contributions presented at the 9th metaheuristic international conference, Udine, Italy, July 25--28, 2011. New York, NY: Springer (2013; Zbl 1282.90008) Full Text: DOI
Tseng, Chiou-Ting; Yang, Chang-Biau; Ann, Hsing-Yen Efficient algorithms for the longest common subsequence problem with sequential substring constraints. (English) Zbl 1255.90107 J. Complexity 29, No. 1, 44-52 (2013). MSC: 90C27 68R15 68T10 90C60 PDFBibTeX XMLCite \textit{C.-T. Tseng} et al., J. Complexity 29, No. 1, 44--52 (2013; Zbl 1255.90107) Full Text: DOI
Csirmaz, Laszlo Using multiobjective optimization to map the entropy region of four random variables. arXiv:1310.4638 Preprint, arXiv:1310.4638 [cs.IT] (2013). MSC: 90C60 90C05 94A17 90C29 BibTeX Cite \textit{L. Csirmaz}, ``Using multiobjective optimization to map the entropy region of four random variables'', Preprint, arXiv:1310.4638 [cs.IT] (2013) Full Text: arXiv OA License
Lee, Kangbok; Choi, Byung-Cheon; Leung, Joseph Y.-T.; Pinedo, Michael L.; Briskorn, Dirk Minimizing the total weighted delivery time in container transportation scheduling. (English) Zbl 1407.90157 Nav. Res. Logist. 59, No. 3-4, 266-277 (2012). MSC: 90B35 90B06 90C60 PDFBibTeX XMLCite \textit{K. Lee} et al., Nav. Res. Logist. 59, No. 3--4, 266--277 (2012; Zbl 1407.90157) Full Text: DOI