InforLorV4, Istex, Corpus, bibRecord, 000676

SCIL — Symbolic Constraints in Integer Linear Programming

Identifieur interne : 000676 ( Istex/Corpus ); précédent : 000675; suivant : 000677

SCIL — Symbolic Constraints in Integer Linear Programming

Auteurs : Ernst Althaus ; Alexander Bockmayr ; Matthias Elf ; Michael Jünger ; Thomas Kasper ; Kurt Mehlhorn

Source :

Lecture Notes in Computer Science [ 0302-9743 ]

RBID : ISTEX:1DADC9ED7085286A646062DB162C7B948D720E64

Abstract

Abstract: We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi.cantly to the expressive power, ease of use, and e.ciency of constraint programming systems.

Url:

https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/fulltext.pdf

DOI: 10.1007/3-540-45749-6_11

Links to Exploration step

ISTEX:1DADC9ED7085286A646062DB162C7B948D720E64

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">SCIL — Symbolic Constraints in Integer Linear Programming</title>
<author><name sortKey="Althaus, Ernst" sort="Althaus, Ernst" uniqKey="Althaus E" first="Ernst" last="Althaus">Ernst Althaus</name>
<affiliation><mods:affiliation>International Computer Science Institute, 1947 Center St., Suite 600, 94704-1198, Berkeley, CA, USA</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: althaus@icsi.berkeley.edu</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name>
<affiliation><mods:affiliation>LORIA, Université Henri Poincaré, B.P. 239, F-54506, Vand-uvre-lès-Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: bockmayr@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Elf, Matthias" sort="Elf, Matthias" uniqKey="Elf M" first="Matthias" last="Elf">Matthias Elf</name>
<affiliation><mods:affiliation>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: elf@informatik.uni-koeln.de</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Junger, Michael" sort="Junger, Michael" uniqKey="Junger M" first="Michael" last="Jünger">Michael Jünger</name>
<affiliation><mods:affiliation>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: mjuenger@informatik.uni-koeln.de</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Kasper, Thomas" sort="Kasper, Thomas" uniqKey="Kasper T" first="Thomas" last="Kasper">Thomas Kasper</name>
<affiliation><mods:affiliation>SAP AG, GBU Supply Chain Management, Neurottstraße 16, 69189, Walldorf, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: thomas.kasper@sap.com</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Mehlhorn, Kurt" sort="Mehlhorn, Kurt" uniqKey="Mehlhorn K" first="Kurt" last="Mehlhorn">Kurt Mehlhorn</name>
<affiliation><mods:affiliation>Max-Planck-Institute für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: mehlhorn@mpi-sb.mpg.de</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:1DADC9ED7085286A646062DB162C7B948D720E64</idno>
<date when="2002" year="2002">2002</date>
<idno type="doi">10.1007/3-540-45749-6_11</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000676</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000676</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">SCIL — Symbolic Constraints in Integer Linear Programming</title>
<author><name sortKey="Althaus, Ernst" sort="Althaus, Ernst" uniqKey="Althaus E" first="Ernst" last="Althaus">Ernst Althaus</name>
<affiliation><mods:affiliation>International Computer Science Institute, 1947 Center St., Suite 600, 94704-1198, Berkeley, CA, USA</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: althaus@icsi.berkeley.edu</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name>
<affiliation><mods:affiliation>LORIA, Université Henri Poincaré, B.P. 239, F-54506, Vand-uvre-lès-Nancy, France</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: bockmayr@loria.fr</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Elf, Matthias" sort="Elf, Matthias" uniqKey="Elf M" first="Matthias" last="Elf">Matthias Elf</name>
<affiliation><mods:affiliation>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: elf@informatik.uni-koeln.de</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Junger, Michael" sort="Junger, Michael" uniqKey="Junger M" first="Michael" last="Jünger">Michael Jünger</name>
<affiliation><mods:affiliation>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: mjuenger@informatik.uni-koeln.de</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Kasper, Thomas" sort="Kasper, Thomas" uniqKey="Kasper T" first="Thomas" last="Kasper">Thomas Kasper</name>
<affiliation><mods:affiliation>SAP AG, GBU Supply Chain Management, Neurottstraße 16, 69189, Walldorf, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: thomas.kasper@sap.com</mods:affiliation>
</affiliation>
</author>
<author><name sortKey="Mehlhorn, Kurt" sort="Mehlhorn, Kurt" uniqKey="Mehlhorn K" first="Kurt" last="Mehlhorn">Kurt Mehlhorn</name>
<affiliation><mods:affiliation>Max-Planck-Institute für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken, Germany</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: mehlhorn@mpi-sb.mpg.de</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi.cantly to the expressive power, ease of use, and e.ciency of constraint programming systems.</div>
</front>
</TEI>
<istex><corpusName>springer-ebooks</corpusName>
<author><json:item><name>Ernst Althaus</name>
<affiliations><json:string>International Computer Science Institute, 1947 Center St., Suite 600, 94704-1198, Berkeley, CA, USA</json:string>
<json:string>E-mail: althaus@icsi.berkeley.edu</json:string>
</affiliations>
</json:item>
<json:item><name>Alexander Bockmayr</name>
<affiliations><json:string>LORIA, Université Henri Poincaré, B.P. 239, F-54506, Vand-uvre-lès-Nancy, France</json:string>
<json:string>E-mail: bockmayr@loria.fr</json:string>
</affiliations>
</json:item>
<json:item><name>Matthias Elf</name>
<affiliations><json:string>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln, Germany</json:string>
<json:string>E-mail: elf@informatik.uni-koeln.de</json:string>
</affiliations>
</json:item>
<json:item><name>Michael Jünger</name>
<affiliations><json:string>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln, Germany</json:string>
<json:string>E-mail: mjuenger@informatik.uni-koeln.de</json:string>
</affiliations>
</json:item>
<json:item><name>Thomas Kasper</name>
<affiliations><json:string>SAP AG, GBU Supply Chain Management, Neurottstraße 16, 69189, Walldorf, Germany</json:string>
<json:string>E-mail: thomas.kasper@sap.com</json:string>
</affiliations>
</json:item>
<json:item><name>Kurt Mehlhorn</name>
<affiliations><json:string>Max-Planck-Institute für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken, Germany</json:string>
<json:string>E-mail: mehlhorn@mpi-sb.mpg.de</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/HCB-XFGWJKR2-2</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi.cantly to the expressive power, ease of use, and e.ciency of constraint programming systems.</abstract>
<qualityIndicators><score>7.378</score>
<pdfWordCount>4874</pdfWordCount>
<pdfCharCount>28357</pdfCharCount>
<pdfVersion>1.3</pdfVersion>
<pdfPageCount>13</pdfPageCount>
<pdfPageSize>630 x 792 pts</pdfPageSize>
<refBibsNative>false</refBibsNative>
<abstractWordCount>42</abstractWordCount>
<abstractCharCount>328</abstractCharCount>
<keywordCount>0</keywordCount>
</qualityIndicators>
<title>SCIL — Symbolic Constraints in Integer Linear Programming</title>
<chapterId><json:string>11</json:string>
<json:string>Chap11</json:string>
</chapterId>
<genre><json:string>conference</json:string>
</genre>
<serie><title>Lecture Notes in Computer Science</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2002</copyrightDate>
<issn><json:string>0302-9743</json:string>
</issn>
<editor><json:item><name>Gerhard Goos</name>
<affiliations><json:string>Karlsruhe University, Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Juris Hartmanis</name>
<affiliations><json:string>Cornell University, NY, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Jan van Leeuwen</name>
<affiliations><json:string>Utrecht University, The Netherlands</json:string>
</affiliations>
</json:item>
</editor>
</serie>
<host><title>Algorithms — ESA 2002</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2002</copyrightDate>
<doi><json:string>10.1007/3-540-45749-6</json:string>
</doi>
<issn><json:string>0302-9743</json:string>
</issn>
<eisbn><json:string>978-3-540-45749-7</json:string>
</eisbn>
<bookId><json:string>3-540-45749-6</json:string>
</bookId>
<isbn><json:string>978-3-540-44180-9</json:string>
</isbn>
<volume>2461</volume>
<pages><first>75</first>
<last>87</last>
</pages>
<genre><json:string>book-series</json:string>
</genre>
<editor><json:item><name>Rolf Möhring</name>
<affiliations><json:string>Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany</json:string>
<json:string>E-mail: moehring@math.tu-berlin.de</json:string>
</affiliations>
</json:item>
<json:item><name>Rajeev Raman</name>
<affiliations><json:string>Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK</json:string>
<json:string>E-mail: r.raman@mcs.le.ac.uk</json:string>
</affiliations>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Algorithm Analysis and Problem Complexity</value>
</json:item>
<json:item><value>Discrete Mathematics in Computer Science</value>
</json:item>
<json:item><value>Numeric Computing</value>
</json:item>
<json:item><value>Data Structures</value>
</json:item>
<json:item><value>Computer Graphics</value>
</json:item>
<json:item><value>Algorithms</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/HCB-XFGWJKR2-2</json:string>
</ark>
<publicationDate>2002</publicationDate>
<copyrightDate>2002</copyrightDate>
<doi><json:string>10.1007/3-540-45749-6_11</json:string>
</doi>
<id>1DADC9ED7085286A646062DB162C7B948D720E64</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">SCIL — Symbolic Constraints in Integer Linear Programming</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<availability><licence>Springer-Verlag Berlin Heidelberg</licence>
</availability>
<date when="2002">2002</date>
</publicationStmt>
<notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note>
<note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">SCIL — Symbolic Constraints in Integer Linear Programming</title>
<author><persName><forename type="first">Ernst</forename>
<surname>Althaus</surname>
</persName>
<email>althaus@icsi.berkeley.edu</email>
<affiliation><orgName type="institution">International Computer Science Institute</orgName>
<address><street>1947 Center St., Suite 600</street>
<postCode>94704-1198</postCode>
<settlement>Berkeley</settlement>
<region>CA</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Alexander</forename>
<surname>Bockmayr</surname>
</persName>
<email>bockmayr@loria.fr</email>
<affiliation><orgName type="department">LORIA</orgName>
<orgName type="institution">Université Henri Poincaré</orgName>
<address><postBox>B.P. 239</postBox>
<postCode>F-54506</postCode>
<settlement>Vand-uvre-lès-Nancy</settlement>
<country key="FR">FRANCE</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Matthias</forename>
<surname>Elf</surname>
</persName>
<email>elf@informatik.uni-koeln.de</email>
<affiliation><orgName type="department">Universität zu Köln</orgName>
<orgName type="institution">Institut für Informatik</orgName>
<address><street>Pohligstraße 1</street>
<postCode>50969</postCode>
<settlement>Köln</settlement>
<country key="DE">GERMANY</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Michael</forename>
<surname>Jünger</surname>
</persName>
<email>mjuenger@informatik.uni-koeln.de</email>
<affiliation><orgName type="department">Universität zu Köln</orgName>
<orgName type="institution">Institut für Informatik</orgName>
<address><street>Pohligstraße 1</street>
<postCode>50969</postCode>
<settlement>Köln</settlement>
<country key="DE">GERMANY</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Thomas</forename>
<surname>Kasper</surname>
</persName>
<email>thomas.kasper@sap.com</email>
<affiliation><orgName type="department">SAP AG</orgName>
<orgName type="institution">GBU Supply Chain Management</orgName>
<address><street>Neurottstraße 16</street>
<postCode>69189</postCode>
<settlement>Walldorf</settlement>
<country key="DE">GERMANY</country>
</address>
</affiliation>
</author>
<author><persName><forename type="first">Kurt</forename>
<surname>Mehlhorn</surname>
</persName>
<email>mehlhorn@mpi-sb.mpg.de</email>
<affiliation><orgName type="institution">Max-Planck-Institute für Informatik</orgName>
<address><street>Stuhlsatzenhausweg 85</street>
<postCode>66123</postCode>
<settlement>Saarbrücken</settlement>
<country key="DE">GERMANY</country>
</address>
</affiliation>
</author>
<idno type="istex">1DADC9ED7085286A646062DB162C7B948D720E64</idno>
<idno type="ark">ark:/67375/HCB-XFGWJKR2-2</idno>
<idno type="DOI">10.1007/3-540-45749-6_11</idno>
</analytic>
<monogr><title level="m" type="main">Algorithms — ESA 2002</title>
<title level="m" type="sub">10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings</title>
<title level="m" type="part">Contributed Papers</title>
<idno type="DOI">10.1007/3-540-45749-6</idno>
<idno type="book-id">3-540-45749-6</idno>
<idno type="ISBN">978-3-540-44180-9</idno>
<idno type="eISBN">978-3-540-45749-7</idno>
<idno type="chapter-id">Chap11</idno>
<idno type="part-id">Part2</idno>
<editor><persName><forename type="first">Rolf</forename>
<surname>Möhring</surname>
</persName>
<email>moehring@math.tu-berlin.de</email>
<affiliation><orgName type="department">Fakultät II: Mathematik und Naturwissenschaften</orgName>
<orgName type="institution">Technische Universität Berlin</orgName>
<address><street>Strasse des 17. Juni 136</street>
<postCode>10623</postCode>
<settlement>Berlin</settlement>
<country key="DE">GERMANY</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Rajeev</forename>
<surname>Raman</surname>
</persName>
<email>r.raman@mcs.le.ac.uk</email>
<affiliation><orgName type="department">Department of Mathematics and Computer Science</orgName>
<orgName type="institution">University of Leicester</orgName>
<address><street>University Road</street>
<postCode>LE1 7RH</postCode>
<settlement>Leicester</settlement>
<country key="GB">UNITED KINGDOM</country>
</address>
</affiliation>
</editor>
<imprint><biblScope unit="vol">2461</biblScope>
<biblScope unit="page" from="75">75</biblScope>
<biblScope unit="page" to="87">87</biblScope>
<biblScope unit="chapter-count">78</biblScope>
<biblScope unit="part-chapter-count">74</biblScope>
</imprint>
</monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Goos</surname>
</persName>
<affiliation><orgName type="institution">Karlsruhe University</orgName>
<address><country key="DE">GERMANY</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Juris</forename>
<surname>Hartmanis</surname>
</persName>
<affiliation><orgName type="institution">Cornell University</orgName>
<address><region>NY</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Jan</forename>
<nameLink>van</nameLink>
<surname>Leeuwen</surname>
</persName>
<affiliation><orgName type="institution">Utrecht University</orgName>
<address><country key=""></country>
</address>
</affiliation>
</editor>
<idno type="pISSN">0302-9743</idno>
<idno type="seriesID">558</idno>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><abstract xml:lang="en"><head>Abstract</head>
<p>We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi.cantly to the expressive power, ease of use, and e.ciency of constraint programming systems.</p>
</abstract>
<textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label>
<item><term type="Primary">Computer Science</term>
</item>
<label>I16021</label>
<item><term type="Secondary" subtype="priority-1">Algorithm Analysis and Problem Complexity</term>
</item>
<label>I17028</label>
<item><term type="Secondary" subtype="priority-2">Discrete Mathematics in Computer Science</term>
</item>
<label>I1701X</label>
<item><term type="Secondary" subtype="priority-3">Numeric Computing</term>
</item>
<label>I15017</label>
<item><term type="Secondary" subtype="priority-4">Data Structures</term>
</item>
<label>I22013</label>
<item><term type="Secondary" subtype="priority-5">Computer Graphics</term>
</item>
<label>M14018</label>
<item><term type="Secondary" subtype="priority-6">Algorithms</term>
</item>
</list>
</keywords>
</textClass>
<langUsage><language ident="EN"></language>
</langUsage>
</profileDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName>
<PublisherLocation>Berlin, Heidelberg</PublisherLocation>
</PublisherInfo>
<Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<FamilyName>Goos</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName>
<FamilyName>Hartmanis</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName>
<Particle>van</Particle>
<FamilyName>Leeuwen</FamilyName>
</EditorName>
</Editor>
<Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName>
<OrgAddress><Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>Cornell University</OrgName>
<OrgAddress><State>NY</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName>
<OrgAddress><Country>The Netherlands</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</SeriesHeader>
<Book Language="En"><BookInfo BookProductType="Proceedings" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-45749-6</BookID>
<BookTitle>Algorithms — ESA 2002</BookTitle>
<BookSubTitle>10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings</BookSubTitle>
<BookVolumeNumber>2461</BookVolumeNumber>
<BookSequenceNumber>2461</BookSequenceNumber>
<BookDOI>10.1007/3-540-45749-6</BookDOI>
<BookTitleID>72485</BookTitleID>
<BookPrintISBN>978-3-540-44180-9</BookPrintISBN>
<BookElectronicISBN>978-3-540-45749-7</BookElectronicISBN>
<BookChapterCount>78</BookChapterCount>
<BookHistory><OnlineDate><Year>2002</Year>
<Month>8</Month>
<Day>29</Day>
</OnlineDate>
</BookHistory>
<BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2002</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I16021" Priority="1" Type="Secondary">Algorithm Analysis and Problem Complexity</BookSubject>
<BookSubject Code="I17028" Priority="2" Type="Secondary">Discrete Mathematics in Computer Science</BookSubject>
<BookSubject Code="I1701X" Priority="3" Type="Secondary">Numeric Computing</BookSubject>
<BookSubject Code="I15017" Priority="4" Type="Secondary">Data Structures</BookSubject>
<BookSubject Code="I22013" Priority="5" Type="Secondary">Computer Graphics</BookSubject>
<BookSubject Code="M14018" Priority="6" Type="Secondary">Algorithms</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
<BookContext><SeriesID>558</SeriesID>
</BookContext>
</BookInfo>
<BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Rolf</GivenName>
<FamilyName>Möhring</FamilyName>
</EditorName>
<Contact><Email>moehring@math.tu-berlin.de</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Rajeev</GivenName>
<FamilyName>Raman</FamilyName>
</EditorName>
<Contact><Email>r.raman@mcs.le.ac.uk</Email>
</Contact>
</Editor>
<Affiliation ID="Aff4"><OrgDivision>Fakultät II: Mathematik und Naturwissenschaften</OrgDivision>
<OrgName>Technische Universität Berlin</OrgName>
<OrgAddress><Street>Strasse des 17. Juni 136</Street>
<Postcode>10623</Postcode>
<City>Berlin</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff5"><OrgDivision>Department of Mathematics and Computer Science</OrgDivision>
<OrgName>University of Leicester</OrgName>
<OrgAddress><Street>University Road</Street>
<Postcode>LE1 7RH</Postcode>
<City>Leicester</City>
<Country>UK</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part2"><PartInfo TocLevels="0"><PartID>2</PartID>
<PartSequenceNumber>2</PartSequenceNumber>
<PartTitle>Contributed Papers</PartTitle>
<PartChapterCount>74</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookID>3-540-45749-6</BookID>
<BookTitle>Algorithms — ESA 2002</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap11" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>11</ChapterID>
<ChapterDOI>10.1007/3-540-45749-6_11</ChapterDOI>
<ChapterSequenceNumber>11</ChapterSequenceNumber>
<ChapterTitle Language="En">SCIL — Symbolic Constraints in Integer Linear Programming</ChapterTitle>
<ChapterFirstPage>75</ChapterFirstPage>
<ChapterLastPage>87</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2002</CopyrightYear>
</ChapterCopyright>
<ChapterHistory><RegistrationDate><Year>2002</Year>
<Month>8</Month>
<Day>28</Day>
</RegistrationDate>
<OnlineDate><Year>2002</Year>
<Month>8</Month>
<Day>29</Day>
</OnlineDate>
</ChapterHistory>
<ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ChapterGrants>
<ChapterContext><SeriesID>558</SeriesID>
<PartID>2</PartID>
<BookID>3-540-45749-6</BookID>
<BookTitle>Algorithms — ESA 2002</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff6"><AuthorName DisplayOrder="Western"><GivenName>Ernst</GivenName>
<FamilyName>Althaus</FamilyName>
</AuthorName>
<Contact><Email>althaus@icsi.berkeley.edu</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Alexander</GivenName>
<FamilyName>Bockmayr</FamilyName>
</AuthorName>
<Contact><Email>bockmayr@loria.fr</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff8"><AuthorName DisplayOrder="Western"><GivenName>Matthias</GivenName>
<FamilyName>Elf</FamilyName>
</AuthorName>
<Contact><Email>elf@informatik.uni-koeln.de</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff8"><AuthorName DisplayOrder="Western"><GivenName>Michael</GivenName>
<FamilyName>Jünger</FamilyName>
</AuthorName>
<Contact><Email>mjuenger@informatik.uni-koeln.de</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff9"><AuthorName DisplayOrder="Western"><GivenName>Thomas</GivenName>
<FamilyName>Kasper</FamilyName>
</AuthorName>
<Contact><Email>thomas.kasper@sap.com</Email>
</Contact>
</Author>
<Author AffiliationIDS="Aff10"><AuthorName DisplayOrder="Western"><GivenName>Kurt</GivenName>
<FamilyName>Mehlhorn</FamilyName>
</AuthorName>
<Contact><Email>mehlhorn@mpi-sb.mpg.de</Email>
</Contact>
</Author>
<Affiliation ID="Aff6"><OrgName>International Computer Science Institute</OrgName>
<OrgAddress><Street>1947 Center St., Suite 600</Street>
<Postcode>94704-1198</Postcode>
<City>Berkeley</City>
<State>CA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff7"><OrgDivision>LORIA</OrgDivision>
<OrgName>Université Henri Poincaré</OrgName>
<OrgAddress><Postbox>B.P. 239</Postbox>
<Postcode>F-54506</Postcode>
<City>Vand-uvre-lès-Nancy</City>
<Country>France</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff8"><OrgDivision>Universität zu Köln</OrgDivision>
<OrgName>Institut für Informatik</OrgName>
<OrgAddress><Street>Pohligstraße 1</Street>
<Postcode>50969</Postcode>
<City>Köln</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff9"><OrgDivision>SAP AG</OrgDivision>
<OrgName>GBU Supply Chain Management</OrgName>
<OrgAddress><Street>Neurottstraße 16</Street>
<Postcode>69189</Postcode>
<City>Walldorf</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff10"><OrgName>Max-Planck-Institute für Informatik</OrgName>
<OrgAddress><Street>Stuhlsatzenhausweg 85</Street>
<Postcode>66123</Postcode>
<City>Saarbrücken</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi.cantly to the expressive power, ease of use, and e.ciency of constraint programming systems.</Para>
</Abstract>
<ArticleNote Type="Misc"><SimplePara>Partially supported by the Future and Emerging Technologies programme of the EU under contract number IST-1999-14186 (ALCOM-FT). Die Arbeit wurde mit der Unterstützung eines Stipendiums im Rahmen des Hochschulsonderprogramms III von Bund und Ländern über den DAAD ermöglicht.</SimplePara>
</ArticleNote>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>SCIL — Symbolic Constraints in Integer Linear Programming</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>SCIL — Symbolic Constraints in Integer Linear Programming</title>
</titleInfo>
<name type="personal"><namePart type="given">Ernst</namePart>
<namePart type="family">Althaus</namePart>
<affiliation>International Computer Science Institute, 1947 Center St., Suite 600, 94704-1198, Berkeley, CA, USA</affiliation>
<affiliation>E-mail: althaus@icsi.berkeley.edu</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Alexander</namePart>
<namePart type="family">Bockmayr</namePart>
<affiliation>LORIA, Université Henri Poincaré, B.P. 239, F-54506, Vand-uvre-lès-Nancy, France</affiliation>
<affiliation>E-mail: bockmayr@loria.fr</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Matthias</namePart>
<namePart type="family">Elf</namePart>
<affiliation>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln, Germany</affiliation>
<affiliation>E-mail: elf@informatik.uni-koeln.de</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Michael</namePart>
<namePart type="family">Jünger</namePart>
<affiliation>Universität zu Köln, Institut für Informatik, Pohligstraße 1, 50969, Köln, Germany</affiliation>
<affiliation>E-mail: mjuenger@informatik.uni-koeln.de</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Thomas</namePart>
<namePart type="family">Kasper</namePart>
<affiliation>SAP AG, GBU Supply Chain Management, Neurottstraße 16, 69189, Walldorf, Germany</affiliation>
<affiliation>E-mail: thomas.kasper@sap.com</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Kurt</namePart>
<namePart type="family">Mehlhorn</namePart>
<affiliation>Max-Planck-Institute für Informatik, Stuhlsatzenhausweg 85, 66123, Saarbrücken, Germany</affiliation>
<affiliation>E-mail: mehlhorn@mpi-sb.mpg.de</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2002</dateIssued>
<copyrightDate encoding="w3cdtf">2002</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: We describe a new software system SCIL that introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi.cantly to the expressive power, ease of use, and e.ciency of constraint programming systems.</abstract>
<relatedItem type="host"><titleInfo><title>Algorithms — ESA 2002</title>
<subTitle>10th Annual European Symposium Rome, Italy, September 17–21, 2002 Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">Rolf</namePart>
<namePart type="family">Möhring</namePart>
<affiliation>Fakultät II: Mathematik und Naturwissenschaften, Technische Universität Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany</affiliation>
<affiliation>E-mail: moehring@math.tu-berlin.de</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Rajeev</namePart>
<namePart type="family">Raman</namePart>
<affiliation>Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK</affiliation>
<affiliation>E-mail: r.raman@mcs.le.ac.uk</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2002</copyrightDate>
<issuance>monographic</issuance>
</originInfo>
<subject><genre>Book-Subject-Collection</genre>
<topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic>
</subject>
<subject><genre>Book-Subject-Group</genre>
<topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16021">Algorithm Analysis and Problem Complexity</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I17028">Discrete Mathematics in Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1701X">Numeric Computing</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I15017">Data Structures</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I22013">Computer Graphics</topic>
<topic authority="SpringerSubjectCodes" authorityURI="M14018">Algorithms</topic>
</subject>
<identifier type="DOI">10.1007/3-540-45749-6</identifier>
<identifier type="ISBN">978-3-540-44180-9</identifier>
<identifier type="eISBN">978-3-540-45749-7</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="BookTitleID">72485</identifier>
<identifier type="BookID">3-540-45749-6</identifier>
<identifier type="BookChapterCount">78</identifier>
<identifier type="BookVolumeNumber">2461</identifier>
<identifier type="BookSequenceNumber">2461</identifier>
<identifier type="PartChapterCount">74</identifier>
<part><date>2002</date>
<detail type="part"><title>Contributed Papers</title>
</detail>
<detail type="volume"><number>2461</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>75</start>
<end>87</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="family">Goos</namePart>
<affiliation>Karlsruhe University, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Juris</namePart>
<namePart type="family">Hartmanis</namePart>
<affiliation>Cornell University, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jan</namePart>
<namePart type="family">van Leeuwen</namePart>
<affiliation>Utrecht University, The Netherlands</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2002</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">1DADC9ED7085286A646062DB162C7B948D720E64</identifier>
<identifier type="ark">ark:/67375/HCB-XFGWJKR2-2</identifier>
<identifier type="DOI">10.1007/3-540-45749-6_11</identifier>
<identifier type="ChapterID">11</identifier>
<identifier type="ChapterID">Chap11</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2002</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2002</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-XFGWJKR2-2/record.json</uri>
</json:item>
</metadata>
</istex>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000676 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000676 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Corpus
   |type=    RBID
   |clé=     ISTEX:1DADC9ED7085286A646062DB162C7B948D720E64
   |texte=   SCIL — Symbolic Constraints in Integer Linear Programming
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

SCIL — Symbolic Constraints in Integer Linear Programming

SCIL — Symbolic Constraints in Integer Linear Programming

Source :

Abstract

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri