Intro
Preface
Organization
Executive Committee
Program Committee
Contents
Covering Balls and HT-Differential for Convex Maximization
1 Introduction
2 Optimality Conditions
2.1 Optimality Condition for Convex Minimization
2.2 Optimality Condition for Convex Maximization
3 Nonlinear Separation or Sandwich Inclusion
4 Convex Maximization Over Polytope
4.1 Local Search
4.2 Covering Sets
4.3 The Largest Inscribed Ball in Polytope
5 Preliminary Subproblems
5.1 Maximization Over a Ball

2.2 Parallel Optimization
2.3 Solution Aggregation
3 Numerical Examples
3.1 Discrete Integral Equation
3.2 Van der Pol Equation
4 Conclusions and Future Research
References
An Approximation Scheme for a Bilevel Knapsack Problem
1 Introduction
2 Problem Definition
2.1 Algorithm
2.2 A Polynomial Time Approximation Scheme for P2
2.3 Analysis
3 Conclusion
References
Efficient Heuristics for a Partial Set Covering Problem with Mutually Exclusive Pairs of Facilities
1 Introduction
2 Problem Statement
3 Solution Algorithms

3.1 Constructive Heuristics
3.2 Local Search
3.3 Variable Neighborhood Search
4 Computational Study
4.1 Test Problems
4.2 Computational Results
References
A Hybrid Genetic Algorithm for the Budget-Constrained Charging Station Location Problem
1 Introduction
2 Literature Review
3 The Charging Station Location Problem
4 The Proposed Genetic Algorithm
4.1 Crossover Mechanism
4.2 Mutation Mechanism
4.3 Local Search Heuristic
5 Experiments
5.1 Case Study
5.2 Experimental Results
5.2.1 Sensitivity Analysis
6 Conclusions
References

Optimal Advertising Expenditure
1 Introduction
2 Mathematical Model
3 The Necessary Conditions and Optimal Solutions
3.1 The Necessary Conditions
3.2 Numerical Simulations and Sensitivity Analysis
4 Conclusion
References
Pre-clustered Generative Adversarial Network Model for Mongolian Font Style Transfer
1 Introduction
2 Model Architecture
2.1 Graph Cluster Aggregator
2.2 Improved the cGAN Model
3 Experiment and Model Evaluation
3.1 Date Set and Environment
3.2 Graph Cluster Aggregation
3.3 Model Testing
3.4 Conclusion
References