• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Structural Analysis in Differential-Algebraic Systems and Combinatorial Optimization

Martin, Sébastien; Mahjoub, Ali Ridha; Lacroix, Mathieu (2009), Structural Analysis in Differential-Algebraic Systems and Combinatorial Optimization, in Kacem, Imed, Computers and Industrial Engineering. International Conference. 2009. (CIE39), IEEE, p. 7

View/Open
structural_lacroix.PDF (291.4Kb)
Type
Communication / Conférence
Date
2009
Conference title
39th International Conference on Computers and Industrial Engineering (CIE'39)
Conference date
2009-07
Conference city
Troyes
Conference country
France
Book title
Computers and Industrial Engineering. International Conference. 2009. (CIE39)
Book author
Kacem, Imed
Publisher
IEEE
ISBN
9781424441358 (print); 9781424441365 (on line)
Number of pages
1921 (3 vol.)
Pages
7
Publication identifier
http://dx.doi.org/10.1109/ICCIE.2009.5223621
Metadata
Show full item record
Author(s)
Martin, Sébastien cc
Mahjoub, Ali Ridha
Lacroix, Mathieu cc
Abstract (EN)
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This problem consists, given a conditional differential algebraic system, in verifying if the system is well-constrained for every state, and if not to find a state in which the system is bad-constrained. We give a formulation for this problem as an integer linear program. This is based on a transformation of the problem to a matching problem in an auxiliary graph. We also show that the linear relaxation of that formulation can be solved in polynomial time. Using this, we develop a branch-and-cut algorithm for solving the problem.
Subjects / Keywords
branch-and-cut; matching; integer program; graph; structural analysis; Differential algebraic system

Related items

Showing items related by title and author.

  • Thumbnail
    Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems. 
    Martin, Sébastien; Mahjoub, Ali Ridha; Lacroix, Mathieu (2011) Article accepté pour publication ou publié
  • Thumbnail
    Structural Analysis for Differential-Algebraic Systems : Complexity, formulation and facets 
    Mahjoub, Ali Ridha; Lacroix, Mathieu; Martin, Sébastien (2010) Communication / Conférence
  • Thumbnail
    Polyhedral Analysis and Branch-and-Cut for the Structural Analysis Problem 
    Lacroix, Mathieu; Mahjoub, Ali Ridha; Martin, Sébastien (2012) Communication / Conférence
  • Thumbnail
    On the NP-completeness of the perfect matching free subgraph problem 
    Lacroix, Mathieu; Mahjoub, Ali Ridha; Martin, Sébastien; Picouleau, Christophe (2012) Article accepté pour publication ou publié
  • Thumbnail
    The vertex k-cut problem 
    Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, Ali Ridha; Martin, Sébastien (2019) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo