default search action
9. DOOR 2016: Vladivostok, Russia
- Yury Kochetov, Michael Yu. Khachay, Vladimir L. Beresnev, Evgeni A. Nurminski, Panos M. Pardalos:
Discrete Optimization and Operations Research - 9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings. Lecture Notes in Computer Science 9869, Springer 2016, ISBN 978-3-319-44913-5
Invited Talks
- Evripidis Bampis
:
Algorithmic Issues in Energy-Efficient Computation. 3-14 - Yair Censor
Linear Superiorization for Infeasible Linear Programming. 15-24 - Victor P. Il'ev, Svetlana Il'eva, Alexander V. Kononov
Short Survey on Graph Correlation Clustering with Minimization Criteria. 25-36 - Jaimie W. Lien
Wardrop Equilibrium for Networks with the BPR Latency Function. 37-49 - Tiago A. Schieber
A Review on Network Robustness from an Information Theory Perspective. 50-60 - Vadim I. Shmyrev
An Iterative Approach for Searching an Equilibrium in Piecewise Linear Exchange Model. 61-73 - Akiyoshi Shioura
Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization. 74-90
Discrete Optimization
- Alexander A. Ageev
Constant-Factor Approximations for Cycle Cover Problems. 93-104 - René van Bevern, Robert Bredereck
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width. 105-120 - A. G. Chentsov
A Scheme of Independent Calculations in a Precedence Constrained Routing Problem. 121-135 - Edward Kh. Gimadi
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs. 136-147 - Edward Gimadi
Efficient Randomized Algorithm for a Vector Subset Problem. 148-158 - Aleksey N. Glebov, Anastasiya V. Gordeeva:
An Algorithm with Approximation Ratio 5/6 for the Metric Maximum m-PSP. 159-170 - Alexander Kel'manov
An Approximation Algorithm for a Problem of Partitioning a Sequence into Clusters with Restrictions on Their Cardinalities. 171-181 - Alexander Kel'manov
A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem. 182-192 - Michael Yu. Khachay
PTAS for the Euclidean Capacitated Vehicle Routing Problem in R^d. 193-205 - Andrei V. Nikolaev
On Integer Recognition over Some Boolean Quadric Polytope Extension. 206-219 - Roman V. Plotnikov
Variable Neighborhood Search-Based Heuristics for Min-Power Symmetric Connectivity Problem in Wireless Networks. 220-232 - Ruslan Simanchev
On the Facets of Combinatorial Polytopes. 233-243 - Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna:
A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem. 244-255
Scheduling Problems
- Alexander A. Ageev
Approximating Coupled-Task Scheduling Problems with Equal Exact Delays. 259-271 - Ilya Chernykh
Routing Open Shop with Unrelated Travel Times. 272-283 - Ilya Chernykh
The 2-Machine Routing Open Shop on a Triangular Transportation Network. 284-297 - Anton V. Eremeev
Mixed Integer Programming Approach to Multiprocessor Job Scheduling with Setup Times. 298-308 - Alexander V. Kononov
On Speed Scaling Scheduling of Parallel Jobs with Preemption. 309-321
Facility Location
- Vladimir L. Beresnev, Andrey A. Melnikov
Facility Location in Unfair Competition. 325-335 - Jack Brimberg, Nenad Mladenovic
Variable Neighborhood Descent for the Capacitated Clustering Problem. 336-349 - Dimitrije D. Cvokic
A Leader-Follower Hub Location Problem Under Fixed Markups. 350-363 - Ivan A. Davydov
Tabu Search Approach for the Bi-Level Competitive Base Station Location Problem. 364-372 - Andrey A. Melnikov
Upper Bound for the Competitive Facility Location Problem with Quantile Criterion. 373-387
Mathematical Programming
- Alexey Chernov, Pavel E. Dvurechensky
Fast Primal-Dual Gradient Method for Strongly Convex Minimization Problems with Linear Constraints. 391-403 - Tatiana V. Gruzdeva
An Approach to Fractional Programming via D.C. Constraints Problem: Local Search. 404-417 - Igor Konnov, Olga Pinyagina
Partial Linearization Method for Network Equilibrium Problems with Elastic Demands. 418-429 - Evgeni A. Nurminski:
Multiple Cuts in Separating Plane Algorithms. 430-440 - Vladimir D. Skarin
On the Parameter Control of the Residual Method for the Correction of Improper Problems of Convex Programming. 441-451 - Alexander S. Strekalovsky
On the Merit and Penalty Functions for the D.C. Optimization. 452-466
Mathematical Economics and Games
- Natalia Aizenberg
Application of Supply Function Equilibrium Model to Describe the Interaction of Generation Companies in the Electricity Market. 469-479 - Igor A. Bykadorov
Chain Store Against Manufacturers: Regulation Can Mitigate Market Distortion. 480-493 - Valeriy M. Marakulin:
On the Existence of Immigration Proof Partition into Countries in Multidimensional Space. 494-508 - Ilya Minarchenko
Search of Nash Equilibrium in Quadratic n-person Game. 509-521
Applications of Operational Research
- Andrey I. Kibzun, Sergey V. Ivanov
Convergence of Discrete Approximations of Stochastic Programming Problems with Probabilistic Criteria. 525-537 - Cemil Turan
A Robust Leaky-LMS Algorithm for Sparse System Identification. 538-546 - Evgeniya A. Vorontsova
Extended Separating Plane Algorithm and NSO-Solutions of PageRank Problem. 547-560
Short Communications
- André Berger, Alexander Grigoriev
Location, Pricing and the Problem of Apollonius. 563-569 - Tatyana Levanova
Variable Neighborhood Search Approach for the Location and Design Problem. 570-577 - Olga Pinyagina
On a Network Equilibrium Problem with Mixed Demand. 578-583
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: