Optimization Problems and Their Applications

Name: Optimization Problems and Their Applications | 7th International Conference, OPTA 2018, Omsk, Russia, July 8-14, 2018, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

7th International Conference, OPTA 2018, Omsk, Russia, July 8-14, 2018, Revised Selected Papers

Anton Eremeev Michael Khachay Yury Kochetov Panos Pardalos(Editor)

Springer (Publisher)

Published on 29. June 2018

XIX, 343 pages

E-Book

PDF with digital watermarking

System requirements

978-3-319-93800-4 (ISBN)

€53.49incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
Organization
Invited Talks
Combinatorial Techniques to Optimally Customize Machining/Assembly Lines
PQSQ Potentials and Tropic Methods in Machine Learning
New Approaches for Multiprocessor Scheduling Problem with Incomplete Information
Optimization, Modeling, and Data Sciences for Sustainable Energy Systems
Contents
Location Problems
On Minimizing Supermodular Functions on Hereditary Systems
1 Introduction
2 Known Results
3 Approximation Guarantees of Algorithm GR
4 A Posteriori Bounds
5 Application to the General p-median Problem
6 Conclusion
References
A New Model of Competitive Location and Pricing with the Uniform Split of the Demand
1 Introduction
2 The Competitive Location and Pricing Problem with the Uniform Split of the Demand
3 The Computational Complexity
4 Special Cases
5 Conclusion
References
Branch and Bound Method for the Weber Problem with Rectangular Facilities on Lines in the Presence of Forbidden Gaps
1 Introduction
2 Statement of the Problem and Its Properties
3 Branch and Bound Method and Results of Computational Experiment
3.1 Lower Bounds
3.2 Branching
3.3 Results of Computational Experiment
4 Conclusion
References
Scheduling and Routing Problems
Inapproximability Lower Bounds for Open Shop Problems with Exact Delays
1 Introduction
2 Preliminaries
3 Inapproximability Lower Bound for O2| exact lj, aj=bj | Cmax
4 Inapproximability Lower Bound for O2|exact lj{0,L}|Cmax
5 Conclusion
References
Exact Solution of One Production Scheduling Problem
1 Introduction
2 Problem Formulation
3 Solving the One-Unit Problem
3.1 Dynamic Programming Algorithm
3.2 Branch-and-Bound Algorithm
4 Solving the Multi-unit Problem
5 Implementation and the Computer Experiments
5.1 Experiments on One-Unit Problem
5.2 Experiments on Multi-unit Problem
6 Conclusion
References
Towards Tractability of the Euclidean Generalized Traveling Salesman Problem in Grid Clusters Defined by a Grid of Bounded Height
1 Introduction
2 Euclidean Generalized Traveling Salesman Problem in Grid Clusters
3 Pseudo-Pyramidal Tours
4 Optimal Tours of EGTSP-GC(h) are l(h)-Pseudo-Pyramidal
5 Conclusion
References
Worst-Case Analysis of a Modification of the Brucker-Garey-Johnson Algorithm
1 Introduction
2 The Existing Literature and Our Contribution
3 BGJ-Algorithm
4 Schedule's Structure
5 Lower Bounds on the Optimal Value of G()
6 Worst-Case Performance Guarantee
7 The Case When pmax&m
References
Reduction of the Pareto Set in Bicriteria Asymmetric Traveling Salesman Problem
1 Introduction
2 Problem Statement
3 Pareto Set Reduction
3.1 Main Approach
3.2 Pareto Set Reduction in Bi-ATSP
4 Multi-Objective Genetic Algorithm
4.1 NSGA-II Scheme
4.2 Recombination and Mutation Operators
5 Computational Experiment
6 Conclusion
References
Optimization Problems in Data Analysis
Randomized Algorithms for Some Clustering Problems
1 Introduction
2 Problems Formulation and Related Problems, Known and Obtained Results
3 Algorithms Foundations
4 Randomized Algorithms
5 Conclusion
References
An Approximation Polynomial Algorithm for a Problem of Searching for the Longest Subsequence in a Finite Sequence of Points in Euclidean Space
1 Introduction
2 Problem Formulation and Related Problems
3 Problem Complexity
4 Auxiliary Results
5 Approximation Algorithm
6 Examples of Numerical Experiments
7 Conclusion
References
On Vector Summation Problem in the Euclidean Space
1 Introduction
2 Exact Algorithm for Solving B-LVS Problem
3 Randomized Algorithm for the B-LVS Problem
4 Conclusion
References
Fast Numerical Evaluation of Periodic Solutions for a Class of Nonlinear Systems and Its Applications for Parameter Estimation Problems
1 Introduction
2 Problem Formulation
2.1 System Definition
2.2 Problem Statement
3 Observer-Based Explicit Parametrized Representations of Periodic Solutions
3.1 Indistinguishable Parametrizations of (4)
3.2 Auxiliary Observer in the Differential Form
3.3 Integral Parametrization of Periodic Solutions of (4)
4 Discussion
5 Example
5.1 Direct Application of the Method
5.2 The Method with RBF Approximation of q
6 Conclusion
References
Mathematical Programming
On Vertices of the Simple Boolean Quadric Polytope Extension
1 Boolean Quadric Polytope
2 3-SAT Relaxation Polytope
3 1-Skeleton
4 Fractional Vertices
5 Conclusions
References
On Accuracy Estimates for One Regularization Method in Linear Programming
1 Introduction
2 Symmetrically Regularized Lagrange Function
3 Alternative Accuracy Estimates
4 Infeasible Linear Programs
5 Conclusion
References
Binary Solutions to Some Systems of Linear Equations
1 Introduction
2 Preliminaries
3 Main Results
4 Discussion
References
Variant of the Cutting Plane Method with Approximation of the Set of Constraints and Auxiliary Functions Epigraphs
1 Introduction
2 Problem Setting
3 The Cutting Plane Method
4 Investigation of the Method's Convergence
5 Conclusion
References
Game Theory and Economical Applications
Sorger Game Under Uncertainty: Discrete Case
1 Introduction
2 Games in Discrete-Time Under Uncertainty
3 Model
4 The Construction of the Strongly Guaranteed Nash Equilibrium
5 Conclusion
References
Public-Private Partnership Models with Tax Incentives: Numerical Analysis of Solutions
1 Introduction
2 Mathematical Model
3 Analysis of the Properties of Equilibrium Solutions
4 Results and Discussion
References
Fuzzy Core Allocations in a Mixed Economy of Arrow-Debreu Type
1 Introduction
2 The Model
2.1 Basic Notation
2.2 Main Definitions
3 Core Allocations in the Mixed Economy E
3.1 Fuzzy K-Core in the Mixed Economy E
3.2 Fuzzy Core Equivalence for L-Equilibrium Allocations
References
Applied Optimization Problems and Metaheuristics
Convergence Analysis of Swarm Intelligence Metaheuristic Methods
1 Introduction
2 Swarm Intelligence Metaheuristic Methods
2.1 Instance- and Model-Based Algorithms
2.2 Generic Procedure
3 Convergence Analysis
4 Model Convergence of SI Optimization Methods
4.1 Preliminary Conditions
4.2 Modification Schemes in the Cases When Subset of Data Constitutes a Solution
4.3 Modification Schemes in the Cases When All Data Constitute a Solution
4.4 Sufficient Conditions for Model Convergence of SI Methods
5 Conclusion and Future Work
References
An Optimization Model for Empty Tank Cars Movement at Railway Petroleum Logistics Market
1 Introduction
2 Problem Formulation
3 Mathematical Model
4 Experimental Study
5 Conclusion and Future Research
References
Complexity of Bi-objective Buffer Allocation Problem in Systems with Simple Structure
1 Introduction
2 Basic Properties and Definitions
2.1 An Illustrative Model of Production Line
2.2 Optimization Criteria and the Set of Feasible Solutions
2.3 Formulation of the Bi-objective Problems
2.4 Monotonicity Properties
3 Computational Complexity of Bi-objective Buffer Allocation Problems on Two-Machine Tandem Line
4 Computational Complexity of Bi-objective Buffer Allocation Problems on Lines of Simple Structure
5 Conclusions
References
Inventory Policies in Dual Sourcing Systems with Uncertain Yield
1 Introduction
2 The Problem
2.1 Assumptions and Notations
3 The Markov Decision Problem
3.1 Linear Programming Formulation
4 Numerical Experiments
5 Conclusions
References
A Genetic Algorithm for the Pooling-Inventory-Capacity Problem in Spare Part Supply Systems
1 Introduction
2 Problem Definition and Optimization Model
3 A Two-Stage Solution Heuristic
3.1 Pooling Policy Generation via GA
3.2 Fitness Evaluation
4 Numerical Study
4.1 Testbed
4.2 Cost Reduction
4.3 Run-Time Performance
5 Conclusions
References
A Core Heuristic and the Branch-and-Price Method for a Bin Packing Problem with a Color Constraint
1 Introduction
2 Mathematical Model
3 Branch-and-Price Method
4 Lower Bounds
5 Core Heuristic
6 Computational Experiments
7 Conclusions
References
On Calculation and Estimation of Flow Transmission Probability in a Communication Network
1 Introduction
2 Cumulative Updating of Network Reliability
3 Problem Statement
4 The Algorithm
4.1 Improvements of the Algorithm
4.2 The Algorithm's Pseudocode
5 Case Studies
5.1 Convergence of Reliability Boundaries
6 Conclusion
References
Profit Maximization and Vehicle Fleet Planning for a Harbor Logistics Company
1 Introduction
2 Mathematical Model
3 Approximation Method
4 Computational Experiments
5 Conclusions
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Optimization Problems and Their Applications

Description

More details

Other editions

Additional editions

Content

System requirements