Combinatorial Optimization Problems with Soft and Hard Requirements
From MaRDI portal
Recommendations
Cited in
(22)- Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths
- Modelling and solving an acyclic multi-period timetabling problem
- Finding a feasible course schedule using Tabu search
- Combinatorial aspects of construction of competition Dutch professional football leagues
- Modeling and solving a real-life assignment problem at universities
- Planning of high school examinations in Denmark
- An integer programming formulation for a case study in university timetabling.
- A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning
- Strong bounds with cut and column generation for class-teacher timetabling
- A tabu search heuristic and adaptive memory procedure for political districting
- A unified modeling and solution framework for combinatorial optimization problems
- Variants of simulated annealing for the examination timetabling problem
- A bi-objective model for the location of landfills for municipal solid waste
- Plenary Lecture 1: The blocking meta-heuristics for combinatorial problems solving
- The blocking meta-heuristics for combinatorial problems solving
- Location modeling for municipal solid waste facilities
- Combinatorial flexibility problems and their computational complexity
- scientific article; zbMATH DE number 2062231 (Why is no real title available?)
- scientific article; zbMATH DE number 2119189 (Why is no real title available?)
- scientific article; zbMATH DE number 1391431 (Why is no real title available?)
- Tabu search for large scale timetabling problems
- Combinatorial optimization problems in wireless switch design
This page was built for publication: Combinatorial Optimization Problems with Soft and Hard Requirements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030582)
