Table of Contents

• Algorithmic Issues in Energy-Efficient ComputationEvripidis Bampis. 3-14 [doi]
• Linear Superiorization for Infeasible Linear ProgrammingYair Censor, Yehuda Zur. 15-24 [doi]
• Short Survey on Graph Correlation Clustering with Minimization CriteriaVictor P. Il'ev, Svetlana Il'eva, Alexander Kononov. 25-36 [doi]
• Wardrop Equilibrium for Networks with the BPR Latency FunctionJaimie W. Lien, Vladimir V. Mazalov, Anna V. Melnik, Jie Zheng. 37-49 [doi]
• A Review on Network Robustness from an Information Theory PerspectiveTiago A. Schieber, Martín Gómez Ravetti, Panos M. Pardalos. 50-60 [doi]
• An Iterative Approach for Searching an Equilibrium in Piecewise Linear Exchange ModelVadim I. Shmyrev. 61-73 [doi]
• Handling Scheduling Problems with Controllable Parameters by Methods of Submodular OptimizationAkiyoshi Shioura, Natalia V. Shakhlevich, Vitaly A. Strusevich. 74-90 [doi]
• Constant-Factor Approximations for Cycle Cover ProblemsAlexander A. Ageev. 93-104 [doi]
• Precedence-Constrained Scheduling Problems Parameterized by Partial Order WidthRené van Bevern, Robert Bredereck, Laurent Bulteau, Christian Komusiewicz, Nimrod Talmon, Gerhard J. Woeginger. 105-120 [doi]
• A Scheme of Independent Calculations in a Precedence Constrained Routing ProblemAlexander G. Chentsov, Alexey M. Grigoryev. 121-135 [doi]
• On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random InputsEdward Kh. Gimadi, Alexey M. Istomin, Oxana Yu. Tsidulko. 136-147 [doi]
• Efficient Randomized Algorithm for a Vector Subset ProblemEdward Gimadi, Ivan Rykov. 148-158 [doi]
• An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSPAleksey N. Glebov, Anastasiya V. Gordeeva. 159-170 [doi]
• An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their CardinalitiesAlexander Kel'manov, Ludmila Mikhailova, Sergey Khamidullin, Vladimir Khandeev. 171-181 [doi]
• A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering ProblemAlexander Kel'manov, Anna Motkova. 182-192 [doi]
• PTAS for the Euclidean Capacitated Vehicle Routing Problem in R^dMichael Khachay, Roman Dubinin. 193-205 [doi]
• On Integer Recognition over Some Boolean Quadric Polytope ExtensionAndrei Nikolaev. 206-219 [doi]
• Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless NetworksRoman V. Plotnikov, Adil I. Erzin, Nenad Mladenovic. 220-232 [doi]
• On the Facets of Combinatorial PolytopesRuslan Simanchev, Inna Urazova. 233-243 [doi]
• A Branch and Bound Algorithm for a Fractional 0-1 Programming ProblemIrina Utkina, Mikhail Batsyn, Ekaterina Batsyna. 244-255 [doi]
• Approximating Coupled-Task Scheduling Problems with Equal Exact DelaysAlexander A. Ageev, Mikhail Ivanov. 259-271 [doi]
• Routing Open Shop with Unrelated Travel TimesIlya Chernykh. 272-283 [doi]
• The 2-Machine Routing Open Shop on a Triangular Transportation NetworkIlya Chernykh, Ekaterina Lgotina. 284-297 [doi]
• Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup TimesAnton V. Eremeev, Yulia V. Kovalenko. 298-308 [doi]
• On Speed Scaling Scheduling of Parallel Jobs with PreemptionAlexander Kononov, Yulia Kovalenko. 309-321 [doi]
• Facility Location in Unfair CompetitionVladimir Beresnev, Andrey Melnikov. 325-335 [doi]
• Variable Neighborhood Descent for the Capacitated Clustering ProblemJack Brimberg, Nenad Mladenovic, Raca Todosijevic, Dragan Urosevic. 336-349 [doi]
• A Leader-Follower Hub Location Problem Under Fixed MarkupsDimitrije D. Cvokic, Yury A. Kochetov, Aleksandr V. Plyasunov. 350-363 [doi]
• Tabu Search Approach for the Bi-Level Competitive Base Station Location ProblemIvan Davydov, Marceau Coupechoux, Stefano Iellamo. 364-372 [doi]
• Upper Bound for the Competitive Facility Location Problem with Quantile CriterionAndrey Melnikov, Vladimir Beresnev. 373-387 [doi]
• Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear ConstraintsAlexey Chernov, Pavel Dvurechensky, Alexander Gasnikov. 391-403 [doi]
• An Approach to Fractional Programming via D.C. Constraints Problem: Local SearchTatiana V. Gruzdeva, Alexander S. Strekalovsky. 404-417 [doi]
• Partial Linearization Method for Network Equilibrium Problems with Elastic DemandsIgor Konnov, Olga Pinyagina. 418-429 [doi]
• Multiple Cuts in Separating Plane AlgorithmsEvgeni A. Nurminski. 430-440 [doi]
• On the Parameter Control of the Residual Method for the Correction of Improper Problems of Convex ProgrammingVladimir D. Skarin. 441-451 [doi]
• On the Merit and Penalty Functions for the D.C. OptimizationAlexander S. Strekalovsky. 452-466 [doi]
• Application of Supply Function Equilibrium Model to Describe the Interaction of Generation Companies in the Electricity MarketNatalia Aizenberg. 469-479 [doi]
• Chain Store Against Manufacturers: Regulation Can Mitigate Market DistortionIgor Bykadorov, Andrea Ellero, Stefania Funari, Sergey Kokovin, Marina Pudova. 480-493 [doi]
• On the Existence of Immigration Proof Partition into Countries in Multidimensional SpaceValeriy M. Marakulin. 494-508 [doi]
• Search of Nash Equilibrium in Quadratic n-person GameIlya Minarchenko. 509-521 [doi]
• Convergence of Discrete Approximations of Stochastic Programming Problems with Probabilistic CriteriaAndrey I. Kibzun, Sergey V. Ivanov. 525-537 [doi]
• A Robust Leaky-LMS Algorithm for Sparse System IdentificationCemil Turan, Yedilkhan Amirgaliev. 538-546 [doi]
• Extended Separating Plane Algorithm and NSO-Solutions of PageRank ProblemEvgeniya Vorontsova. 547-560 [doi]
• Location, Pricing and the Problem of ApolloniusAndré Berger, Alexander Grigoriev, Artem Panin, Andrej Winokurow. 563-569 [doi]
• Variable Neighborhood Search Approach for the Location and Design ProblemTatyana Levanova, Alexander Gnusarev. 570-577 [doi]
• On a Network Equilibrium Problem with Mixed DemandOlga Pinyagina. 578-583 [doi]