close
1.

電子ブック

EB
edited by Ilias S. Kotsireas, Panos M. Pardalos
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2020
シリーズ名: Theoretical Computer Science and General Issues ; 12096
オンライン: https://doi.org/10.1007/978-3-030-53552-0
所蔵情報: loading…
目次情報: 続きを見る
Optimization for Urban Air Mobility
A Matheuristic Algorithm for solving the Vehicle Routing Problem with Cross-Docking
Physical activity as a risk factor in the progression of Osteoarthritis: A machine learning perspective
QPTAS for the CVRP with a moderate number of routes in a metric space of any xed doubling dimension
Early detection of eating disorders through machine learning techniques
On Finding Minimum Cardinality Subset of Vectors with a Constraint on the Sum of Squared Euclidean Pairwise Distances
Practical Approximation Algorithms for Stabbing Special Families of Line Segments with Equal Disks
A Class of Linear Programs Solvable by Coordinate-wise Minimization
Travel times equilibration procedure for route- flow traffic assignment problem
confStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms
Randomized Algorithms for Some Sequence Clustering Problems
Hyper-parameterized Dialectic Search for Non-Linear Box-constrained Optimization with Heterogenous Variable Types
Least Squares K-SVCR Multi-class Classification
Active learning based framework for image captioning corpus creation
Reducing space search in combinatorial optimization using machine learning tools
Impact of the Discretization of VOCs for Cancer Prediction using a Multi-Objective Algorithm
AUGMECON2 method for a bi-objective U-shaped assembly line balancing problem
Two-Channel Conflict-Free Square Grid Aggregation
Online Stacking using RL with Positional and Tactical Features
Power consumption estimation in data centers using machine learning techniques
Automated tuning of a column generation algorithm
Pool-based Realtime Algorithm Configuration: A Preselection Bandit Approach
A Memetic Approach for the Unicost Set Covering Problem
Dynamic Visual Few-Shot Learning through Parameter Prediction Network
An Alternating DCA-based Approach for Reduced-Rank Multitask Linear Regression with Covariance Estimation
PSO-based cooperative learning using chunking
The problem of the hospital surgery department debottlenecking
Learning Optimal Control of Water Distribution Networks through Sequential Model-based Optimization
Composition of kernel and acquisition functions for High Dimensional Bayesian Optimization
A Pareto Simulated Annealing for the Integrated Problem of Berth and Quay Crane Scheduling at Maritime Container Terminals with Multiple Objectives and Stochastic Arrival Times of Vessels
HotelSimu: Simulation-based Optimization for Hotel Dynamic Pricing
Heuristic Search Strategies for Noisy Optimization
Uncertainty of efficient frontier in portfolio optimization
Learning to configure mathematical programming solvers by mathematical programming
Convex Hulls in Solving Multiclass Pattern Recognition Problem
Least Correntropic Loss Regression
Novelty Discovery with Kernel Minimum Enclosing Balls
DESICOM as Metaheuristic Search
Optimization for Urban Air Mobility
A Matheuristic Algorithm for solving the Vehicle Routing Problem with Cross-Docking
Physical activity as a risk factor in the progression of Osteoarthritis: A machine learning perspective
2.

電子ブック

EB
by Ding-Zhu Du, Panos M. Pardalos, Xiaodong Hu, Weili Wu
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2022
シリーズ名: Springer Optimization and Its Applications ; 196
オンライン: https://doi.org/10.1007/978-3-031-10596-8
所蔵情報: loading…
目次情報: 続きを見る
1. Introduction.-2. Divide-and-Conquer
3. Dynamic Programming and Shortest Path
4. Greedy Algorithm and Spanning Tree
5. Incremental Method and Maximum Network Flow
6. Linear Programming
7. Primal-Dual Methods and Minimum Cost Flow
8. NP-hard Problems and Approximation Algorithms
9. Restriction and Steiner Tree
10. Greedy Approximation and Submodular Optimization
11. Relaxation and Rounding. 12. Nonsubmodular Optimization
Bibliography
1. Introduction.-2. Divide-and-Conquer
3. Dynamic Programming and Shortest Path
4. Greedy Algorithm and Spanning Tree