Constraint programming approach to a bilevel scheduling problem

András Kovács, Tamás Kis

Research output: Contribution to conferencePaper

Abstract

Bilevel optimization problems involve two decision makers who make their choices sequentially, either one according to its own objective function. Many problems arising in economy and management science can be modeled as bilevel optimization problems. Several special cases of bilevel problem have been studied in the literature, e.g., linear bilevel problems. However, up to now, very little is known about solution techniques of discrete bilevel problems. In this paper we show that constraint programming can be used to model and solve such problems. We demonstrate our first results on a simple bilevel scheduling problem.

Original languageEnglish
Pages17-26
Number of pages10
Publication statusPublished - Dec 1 2009
EventWorkshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2009 - Thessaloniki, Greece
Duration: Sep 19 2009Sep 19 2009

Other

OtherWorkshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2009
CountryGreece
CityThessaloniki
Period9/19/099/19/09

ASJC Scopus subject areas

  • Artificial Intelligence
  • Management Science and Operations Research
  • Applied Mathematics
  • Control and Optimization

Fingerprint Dive into the research topics of 'Constraint programming approach to a bilevel scheduling problem'. Together they form a unique fingerprint.

  • Cite this

    Kovács, A., & Kis, T. (2009). Constraint programming approach to a bilevel scheduling problem. 17-26. Paper presented at Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2009, Thessaloniki, Greece.