Computer Science
Mixed Integer Programming
100%
Integer Programming
63%
Programming Model
55%
Multiobjective
54%
Path Protection
34%
Scheduling Problem
34%
Matheuristics
31%
Vehicle Routing
29%
Data Instance
25%
Task Graph
23%
Variable Neighborhood Search
23%
Search Heuristic
23%
Embedded Systems
23%
Heuristic Method
23%
Design-Space Exploration
23%
Adaptive Large Neighborhood Search Algorithm
23%
Planning Horizon
21%
Integer-Linear Programming
19%
Commercial Product
17%
Adaptive Large Neighborhood Search
17%
Protection Method
15%
Network Design Problem
15%
Column Generation
15%
Metaheuristics
13%
Soft Constraint
13%
System Analysis
13%
Ring Network
11%
Virtual Private Networks
11%
Point Connection
11%
Branch-and-Bound Algorithm
11%
Cutting Plane Algorithm
11%
Emerging Technology
11%
Optimal Routing
11%
Traffic Management System
11%
Evaluation Function
11%
Integer Program
11%
Problem Setting
11%
multi-objective evolutionary algorithm
11%
School Management
11%
multi-processor
11%
School Administration
11%
Heterogeneous Multiprocessor
11%
Approximation (Algorithm)
11%
Health Care
11%
And-States
11%
Continuous Time
11%
Markov Decision Process
11%
Search Procedure
11%
Exact Algorithm
11%
Allocation Problem
11%
Keyphrases
Mixed Integer Programming
48%
XHSTT
34%
International Timetabling Competition 2019
34%
High School
34%
Fix-and-optimize
30%
School Timetabling
26%
International Timetabling Competition
24%
Hierarchical Method
23%
Hierarchical Ring
23%
Ring Network
23%
Local Displacement
23%
Displacement Constraint
23%
Structural Topology Design
23%
Shared Backup Path Protection
23%
Educational Timetabling
23%
Multi-objective Design Space Exploration
23%
Integer Programming
23%
Flow Formulation
23%
Curriculum-based Course Timetabling
23%
Course Timetabling Problem
23%
Denmark
21%
Mixed Integer Programming Formulations
21%
Solution Algorithm
19%
High School Timetabling Problem
17%
Integer Programming Formulation
17%
Minimum Cost Flow Problem
15%
Single Link
15%
Student Sectioning
14%
Protection Planning
13%
Matheuristic
13%
Capacity Efficiency
13%
Computational Results
12%
Problem Instances
12%
Label Space Dimension Reduction
11%
Network Survivability
11%
Cost Optimisation Method
11%
Local Failure
11%
Distributed Computing
11%
Next Generation Networks
11%
Failure Information
11%
Technology Costs
11%
Local Stress Constraints
11%
Design Problems
11%
Driver Scheduling
11%
Variable Neighborhood Search
11%
Optical Node
11%
Right Place
11%
Optical Wavelength Conversion
11%
Fixed-charge Networks
11%
Branch-and-cut
11%
Engineering
Search Neighborhood
75%
Real Life
42%
Design Problem
34%
Search Algorithm
34%
Programming Model
34%
Linear Programming
26%
Mixed-Integer Programming Model
24%
Simulation Result
23%
Displacement Constraint
23%
Stress Constraint
23%
Local Stress
23%
Flow Problem
23%
Planning Horizon
19%
Recurrent
17%
Tasks
16%
Optimality
14%
Optimization Method
13%
Illustrates
11%
Optimisation Problem
11%
Embedded Application
11%
Main Component
11%
Complete Model
11%
Exact Algorithm
11%
Network Capacity
11%
Feasible Solution
11%
Hybrid Approach
11%
Solution Process
11%
Single Link
11%
Complex Model
11%
Plane Load
11%
Traffic Management
11%
Reasonable Time
11%
Space Solution
11%
Railway
11%
Problem Description
11%
Network Model
11%
Control Plane
11%
Operational Problem
11%
Data Format
11%
Neighborhood Relation
11%
Subsection
11%
Action Space
11%
Operating Room
11%
Health Care
11%
Static Equilibrium
11%
Solution Algorithm
11%
Major Problem
11%
Observables
11%
Markov Decision Process
11%
Cutting Plane
11%
