Communications in Computer and Information Science - Optimization and Learning
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 27)

H-INDEX

(FIVE YEARS 0)

Published By Springer International Publishing

9783030856717, 9783030856724

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

An Exploratory Analysis on a Disinformation Dataset

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_11 ◽

2021 ◽

pp. 144-155

Author(s):

Matheus Marinho ◽

Carmelo J. A. Bastos-Filho ◽

Anthony Lins

Keyword(s):

Exploratory Analysis

Download Full-text

Solving QAP with Auto-parameterization in Parallel Hybrid Metaheuristics

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_22 ◽

2021 ◽

pp. 294-309

Author(s):

Jonathan Duque ◽

Danny A. Múnera ◽

Daniel Díaz ◽

Salvador Abreu

Keyword(s):

Hybrid Metaheuristics ◽

Parallel Hybrid

Download Full-text

Solving Inventory Routing Problems with the Gurobi Branch-and-Cut Algorithm

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_13 ◽

2021 ◽

pp. 173-189

Author(s):

Danny Meier ◽

Benjamin Keller ◽

Markus Kolb ◽

Thomas Hanne

Keyword(s):

Branch And Cut ◽

Inventory Routing ◽

Routing Problems

Download Full-text

Guiding Representation Learning in Deep Generative Models with Policy Gradients

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_9 ◽

2021 ◽

pp. 115-131

Author(s):

Luca Lach ◽

Timo Korthals ◽

Francesco Ferro ◽

Helge Ritter ◽

Malte Schilling

Keyword(s):

Representation Learning ◽

Generative Models

Download Full-text

Incorporating User Preferences in Multi-objective Feature Selection in Software Product Lines Using Multi-Criteria Decision Analysis

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_27 ◽

2021 ◽

pp. 361-373

Author(s):

Takfarinas Saber ◽

Malika Bendechache ◽

Anthony Ventresque

Keyword(s):

Feature Selection ◽

Decision Analysis ◽

Software Product Lines ◽

User Preferences ◽

Product Lines ◽

Multi Criteria Decision Analysis ◽

Multi Objective ◽

Software Product

Download Full-text

Automatic Synthesis of Boolean Networks from Biological Knowledge and Data

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_12 ◽

2021 ◽

pp. 156-170

Author(s):

Athénaïs Vaginay ◽

Taha Boukhobza ◽

Malika Smaïl-Tabbone

Keyword(s):

Boolean Networks ◽

Biological Knowledge ◽

Automatic Synthesis

Download Full-text

A Comparison of Learnheuristics Using Different Reward Functions to Solve the Set Covering Problem

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_6 ◽

2021 ◽

pp. 74-85

Author(s):

Broderick Crawford ◽

Ricardo Soto ◽

Felipe Cisternas-Caneo ◽

Diego Tapia ◽

Hanns de la Fuente-Mella ◽

...

Keyword(s):

Set Covering ◽

Covering Problem ◽

Set Covering Problem ◽

Reward Functions

Download Full-text

Synthesis of Scheduling Heuristics by Composition and Recombination

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_21 ◽

2021 ◽

pp. 283-293

Author(s):

Dominik Mäckel ◽

Jan Winkels ◽

Christin Schumacher

Download Full-text

A Learning-Based Iterated Local Search Algorithm for Solving the Traveling Salesman Problem

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_4 ◽

2021 ◽

pp. 45-61

Author(s):

Maryam Karimi-Mamaghan ◽

Bastien Pasdeloup ◽

Mehrdad Mohammadi ◽

Patrick Meyer

Keyword(s):

Local Search ◽

Traveling Salesman Problem ◽

Search Algorithm ◽

Iterated Local Search ◽

Traveling Salesman ◽

Local Search Algorithm ◽

The Traveling Salesman Problem

Download Full-text

A Genetic Algorithm for the Three-Dimensional Open Dimension Packing Problem

Communications in Computer and Information Science - Optimization and Learning ◽

10.1007/978-3-030-85672-4_15 ◽

2021 ◽

pp. 203-215

Author(s):

Cong Tan Trinh Truong ◽

Lionel Amodeo ◽

F. Yalaoui

Keyword(s):

Genetic Algorithm ◽

Three Dimensional ◽

Packing Problem

Download Full-text

Communications in Computer and Information Science - Optimization and LearningLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer International Publishing

An Exploratory Analysis on a Disinformation Dataset

Solving QAP with Auto-parameterization in Parallel Hybrid Metaheuristics

Solving Inventory Routing Problems with the Gurobi Branch-and-Cut Algorithm

Guiding Representation Learning in Deep Generative Models with Policy Gradients

Incorporating User Preferences in Multi-objective Feature Selection in Software Product Lines Using Multi-Criteria Decision Analysis

Automatic Synthesis of Boolean Networks from Biological Knowledge and Data

A Comparison of Learnheuristics Using Different Reward Functions to Solve the Set Covering Problem

Synthesis of Scheduling Heuristics by Composition and Recombination

A Learning-Based Iterated Local Search Algorithm for Solving the Traveling Salesman Problem

A Genetic Algorithm for the Three-Dimensional Open Dimension Packing Problem

Communications in Computer and Information Science - Optimization and Learning
Latest Publications