Combinatorial Optimization Problems with Soft and Hard Requirements

DOI10.2307/2582319zbMath0626.90061OpenAlexW4238495911MaRDI QIDQ3030582

H. A. Eiselt, Gilbert Laporte

Publication date: 1987

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582319

zbMATH Keywords

heuristicsschedulingmultiobjective optimizationresource allocation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (13)

Location modeling for municipal solid waste facilities ⋮ Variants of simulated annealing for the examination timetabling problem ⋮ Planning of high school examinations in Denmark ⋮ An integer programming formulation for a case study in university timetabling. ⋮ 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 ⋮ A bi-objective model for the location of landfills for municipal solid waste ⋮ Strong bounds with cut and column generation for class-teacher timetabling ⋮ Modeling and solving a real-life assignment problem at universities ⋮ Tabu search for large scale timetabling problems ⋮ A tabu search heuristic and adaptive memory procedure for political districting

This page was built for publication: Combinatorial Optimization Problems with Soft and Hard Requirements