Álinson S. Xavier - Dblp

Schloss Dagstuhl - Leibniz Center for Informatics
  • dblp
    • Blog
    • Statistics
    • Update feed
    • dblp artifacts @ DROPS
    • XML dump
    • RDF dump
  • browse
    • Persons
    • Conferences
    • Journals
    • Series
    • Repositories
  • search
    • Search dblp
    • SPARQL queries
    • Lookup by ID
  • about
    • F.A.Q.
    • Team
    • Advisory Board
    • License
    • Privacy
    • Imprint
  • nfdi
    • NFDI - National Research Data Infrastructure Germany
    • consortia
    • NFDIxCS
    • events | mastodon
    • NFDI4DataScience
    • ORKG
    • CEUR
    • MyBinder
    • events | mastodon | publications
  • donate
    • learn more
    • donate using PayPal
  • stop the war!
    • Зупиніть війну!
    • Остановите войну!
    • solidarity - (ua) - (ru)
    • news - (ua) - (ru)
    • donate - donate - donate
    • for scientists
    • ERA4Ukraine
    • Assistance in Germany
    • Ukrainian Global University

dblp is humbly asking you for your kind support.

The dblp computer science bibliography is, and will always be, a free and non-profit service for the international computer science community, and a common good for our community.

Today, the global service provided by dblp faces a strong increase in demand. However, its net budget is shrinking. There are no signs that this trend will turn around.

This is why we humbly ask for your support in the form of a donation to Schloss Dagstuhl LZI. Even just a small contribution can make a difference. Thank you very much!

learn more donate using PayPal

Your feedback is essential – not only for improving dblp, but also for demonstrating its impact to our public funders, who rely on our community input when evaluating our work. That’s why we warmly invite you to take part in our 2025 user survey. Your insights help us understand how the community uses dblp and directly shape its future development. Thank you for contributing to dblp’s future! search dblpsearch dblp

default search action

  • combined dblp search
  • author search
  • venue search
  • publication search
Authors:
  • no matches
  • waiting...
Venues:
  • no matches
  • waiting...
Publications:
  • no matches
  • waiting...
clearask others

ask others

  • Google
  • Google Scholar
  • Semantic Scholar
  • Internet Archive Scholar
  • CiteSeerX
  • ORCID
  • top
  • '20
  • '10
  • coauthors
  • bottom
mirrorDagstuhl
  • Trier
orderby year
  • by type
  • > Home > Persons

run query for this person

  • highly cited coauthors
  • co-cited other authors
  • non-coauthors with many coauthors in common
  • highly cited publications
  • co-cited publications
  • authors citing this author
  • number of authors per paper

or build your own?

showing all ?? records
  • 2025
  • [j7]
    • view

      • electronic edition via DOI
      • unpaywalled version
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/mp/MunozPX25
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/mp/MunozPX25
    , , : Compressing branch-and-bound trees. Math. Program. 210(1): 669-694 ()
  • 2024
  • [j6]
    • view

      • electronic edition via DOI
      • unpaywalled version
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/informs/XavierDQ24
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/informs/XavierDQ24
    , , : Decomposable Formulation of Transmission Constraints for Decentralized Power Systems Optimization. INFORMS J. Comput. 36(6): 1562-1578 ()
  • [i4]
    • view

      • electronic edition via DOI (open access)
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/corr/abs-2409-09220
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/corr/abs-2409-09220
    , , , , , : Market Implications of Alternative Operating Reserve Modeling in Wholesale Electricity Markets. CoRR abs/2409.09220 ()
  • [i3]
    • view

      • electronic edition via DOI (open access)
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/corr/abs-2410-01986
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/corr/abs-2410-01986
    , , , , : An Analysis of Market-to-Market Coordination. CoRR abs/2410.01986 ()
  • 2023
  • [c1]
    • view

      • electronic edition via DOI
      • unpaywalled version
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • conf/ipco/MunozPX23
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/conf/ipco/MunozPX23
    , , : Compressing Branch-and-Bound Trees. IPCO : 348-362
  • [i2]
    • view

      • electronic edition via DOI (open access)
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/corr/abs-2310-03258
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/corr/abs-2310-03258
    , , , , , , : Detecting Electricity Service Equity Issues with Transfer Counterfactual Learning on Large-Scale Outage Datasets. CoRR abs/2310.03258 ()
  • 2021
  • [j5]
    • view

      • electronic edition via DOI
      • unpaywalled version
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/informs/XavierQA21
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/informs/XavierQA21
    , , : Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems. INFORMS J. Comput. 33(2): 739-756 ()
  • [j4]
    • view

      • electronic edition via DOI
      • unpaywalled version
      • details & citations

      authority control:

      • Crossref APIOpenAlex APIWikidata
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/informs/XavierFP21
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/informs/XavierFP21
    , , : Multirow Intersection Cuts Based on the Infinity Norm. INFORMS J. Comput. 33(4): 1624-1643 ()
  • 2019
  • [j3]
    • view

      • electronic edition via DOI
      • unpaywalled version
      • details & citations

      authority control:

      • Crossref APIOpenAlex APIWikidata
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/mpc/FukasawaPX19
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/mpc/FukasawaPX19
    , , : The (not so) trivial lifting in two dimensions. Math. Program. Comput. 11(2): 211-235 ()
  • [i1]
    • view

      • electronic edition @ arxiv.org (open access)
      • details & citations
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/corr/abs-1902-01697
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/corr/abs-1902-01697
    , , : Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems. CoRR abs/1902.01697 ()
  • 2018
  • [j2]
    • view

      • electronic edition via DOI
      • unpaywalled version
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/mpc/FukasawaPX18
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/mpc/FukasawaPX18
    , , : Intersection cuts for single row corner relaxations. Math. Program. Comput. 10(3): 423-455 ()
  • 2017
  • [b1]
    • view

      • electronic edition via handle.net
      • details & citations

      authority control:

      • BASE
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • phd/basesearch/Xavier17
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/phd/basesearch/Xavier17
    : Computing with Multi-Row Intersection Cuts. University of Waterloo, Ontario, Canada,
  • 2011
  • [j1]
    • view

      • electronic edition via DOI
      • unpaywalled version
      • details & citations

      authority control:

      • Crossref APIOpenAlex API
    • export record

      • BibTeX
      • RIS
      • RDF N-Triples
      • RDF Turtle
      • RDF/XML
      • XML

      dblp key:

      • journals/endm/XavierC11
    • ask others

      • Google
      • Google Scholar
      • Semantic Scholar
      • Internet Archive Scholar
      • CiteSeerX
      • PubPeer
    • share record

      • Bluesky
      • Reddit
      • BibSonomy
      • LinkedIn

      persistent URL:

      • https://dblp.org/rec/journals/endm/XavierC11
    , : A New Facet Generating Procedure for the Stable Set Polytope. Electron. Notes Discret. Math. 37: 183-188 ()
11Shabbir Ahmed 0001[j5] [i1] 2Manoel B. Campêlo[j1] 31Yonghong Chen[i4] 41Hamid Davoudi[i4] 51Santanu Subhas Dey[j6] 62Ricardo Fukasawa[j4] [j3] [j2] 71Yongpei Guan[i3] 81Sarah Huestis-Mitchellaka: Sarah A. Huestis-Mitchell[i2] 91Xiangrui Kong[i2] 101Gonzalo Muñoz 0001[j7] [c1] 111Joseph Paat[j7] [c1] 122Laurent Poirrier[j4] [j3] [j2] 131Feng Qiu[j6] [i4] [i3] [i2] [j5] [i1] 141Weihang Ren[i3] 151Di Shi[i4] 161Fengyu Wang[i4] [i3] 171Song Wei[i2] 181Yao Xie 0002[i2] 191Shixiang Zhu[i2]

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.

Unpaywalled article links

Add open access links from unpaywall.org to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the web.archive.org of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from crossref.org, opencitations.net, and semanticscholar.org to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from opencitations.net and semanticscholar.org to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from openalex.org.

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

w3c valid html last updated on 2025-04-09 21:29 CEST by the dblp team

cc zero all metadata released as open data under CC0 1.0 license

see also: Terms of Use | Privacy Policy | Imprint

dblp was originally created in 1993 at:

University of Trier

since 2018, dblp has been operated and maintained by:

Schloss Dagstuhl - Leibniz Center for Informatics

the dblp computer science bibliography is funded and supported by:

BMFTR RLP SL Leibniz DFG NFDI

Tag » álinson S Xavier