• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : 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 - Request a copy

Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems.

Martin, Sébastien; Mahjoub, Ali Ridha; Lacroix, Mathieu (2011), Combinatorial optimization model and MIP formulation for the structural analysis of conditional differential-algebraic systems., Computers & Industrial Engineering, 61, 2, p. 422-429. http://dx.doi.org/10.1016/j.cie.2010.12.002

Type
Article accepté pour publication ou publié
Date
2011
Journal name
Computers & Industrial Engineering
Volume
61
Number
2
Publisher
Elsevier
Pages
422-429
Publication identifier
http://dx.doi.org/10.1016/j.cie.2010.12.002
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 structuralanalysis problem for differential-algebraicsystems with conditional equations. This problem consists, given a conditionaldifferential-algebraic system, in verifying if the system is structurally nonsingular for every state, and if not in finding a state in which the system is structurally singular. We give a formulation for this problem as an integer linear program. This is based on a transformation of the problem into 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 and present some experimental results.
Subjects / Keywords
Branch-and-Cut algorithm; Matching; Integer linear program; Graph; Structural analysis; Differential-algebraic system

Related items

Showing items related by title and author.

  • Thumbnail
    Structural Analysis in Differential-Algebraic Systems and Combinatorial Optimization 
    Martin, Sébastien; Mahjoub, Ali Ridha; Lacroix, Mathieu (2009) Communication / Conférence
  • 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
    Mathematical formulations for the Balanced Vertex k-Separator Problem 
    Cornaz, Denis; Furini, Fabio; Lacroix, Mathieu; Malaguti, Enrico; Mahjoub, Ali Ridha; Martin, Sébastien (2014) 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é
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