InforLorV4, PascalFrancis, Corpus, bibRecord, 000903

Network flow problems in constraint programming

Identifieur interne : 000903 ( PascalFrancis/Corpus ); précédent : 000902; suivant : 000904

Network flow problems in constraint programming

Auteurs : Alexander Bockmayr ; Nicolai Pisaruk ; Abderrahmane Aggoun

Source :

Lecture notes in computer science [ 0302-9743 ] ; 2001.

RBID : Pascal:02-0048383

Descripteurs français

Pascal (Inist)
- Flot réseau, Sémantique opérationnelle, Programmation logique avec contrainte, Résolution problème, Sémantique déclarative.

English descriptors

KwdEn :
- Constraint logic programming, Network flow, Operational semantics, Problem solving.

Abstract

We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2239`
A08	`01`	`1`	`ENG`	`@1 Network flow problems in constraint programming`
A09	`01`	`1`	`ENG`	`@1 CP 2001 : principles and practice of constraint programming : Paphos, 26 November - 1 December 2001`
A11	`01`	`1`		`@1 BOCKMAYR (Alexander)`
A11	`02`	`1`		`@1 PISARUK (Nicolai)`
A11	`03`	`1`		`@1 AGGOUN (Abderrahmane)`
A12	`01`	`1`		`@1 WALSH (Toby) @9 ed.`
A14	`01`			`@1 Université Henri Poincaré, LORIA, B.P. 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A14	`02`			`@1 COSYTEC S.A., Parc Club Orsay Université 4, rue Jean Rostand @2 91893 Orsay @3 FRA @Z 3 aut.`
A20				`@1 196-210`
A21				`@1 2001`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-42863-1`
A43	`01`			`@1 INIST @2 16343 @5 354000097041240140`
A44				`@0 0000 @1 © 2002 INIST-CNRS. All rights reserved.`
A45				`@0 17 ref.`
A47	`01`	`1`		`@0 02-0048383`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C01	`01`		`ENG`	`@0 We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.`
C02	`01`	`X`		`@0 001D02A07`
C03	`01`	`X`	`FRE`	`@0 Flot réseau @5 01`
C03	`01`	`X`	`ENG`	`@0 Network flow @5 01`
C03	`01`	`X`	`SPA`	`@0 Flujo red @5 01`
C03	`02`	`X`	`FRE`	`@0 Sémantique opérationnelle @5 02`
C03	`02`	`X`	`ENG`	`@0 Operational semantics @5 02`
C03	`02`	`X`	`SPA`	`@0 Semantica operacional @5 02`
C03	`03`	`X`	`FRE`	`@0 Programmation logique avec contrainte @5 03`
C03	`03`	`X`	`ENG`	`@0 Constraint logic programming @5 03`
C03	`03`	`X`	`SPA`	`@0 Programación lógica con restricción @5 03`
C03	`04`	`X`	`FRE`	`@0 Résolution problème @5 04`
C03	`04`	`X`	`ENG`	`@0 Problem solving @5 04`
C03	`04`	`X`	`SPA`	`@0 Resolución problema @5 04`
C03	`05`	`X`	`FRE`	`@0 Sémantique déclarative @4 INC @5 82`
N21				`@1 021`

A30	`01`	`1`	`ENG`	`@1 International conference on principles and practice of constriant programming @2 7 @3 Paphos CYP @4 2001-11-26`

Format Inist (serveur)

NO :	PASCAL 02-0048383 INIST
ET :	Network flow problems in constraint programming
AU :	BOCKMAYR (Alexander); PISARUK (Nicolai); AGGOUN (Abderrahmane); WALSH (Toby)
AF :	Université Henri Poincaré, LORIA, B.P. 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.); COSYTEC S.A., Parc Club Orsay Université 4, rue Jean Rostand/91893 Orsay/France (3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2239; Pp. 196-210; Bibl. 17 ref.
LA :	Anglais
EA :	We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.
CC :	001D02A07
FD :	Flot réseau; Sémantique opérationnelle; Programmation logique avec contrainte; Résolution problème; Sémantique déclarative
ED :	Network flow; Operational semantics; Constraint logic programming; Problem solving
SD :	Flujo red; Semantica operacional; Programación lógica con restricción; Resolución problema
LO :	INIST-16343.354000097041240140
ID :	02-0048383

Links to Exploration step

Pascal:02-0048383

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Network flow problems in constraint programming</title>
<author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name>
<affiliation><inist:fA14 i1="01"><s1>Université Henri Poincaré, LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Pisaruk, Nicolai" sort="Pisaruk, Nicolai" uniqKey="Pisaruk N" first="Nicolai" last="Pisaruk">Nicolai Pisaruk</name>
<affiliation><inist:fA14 i1="01"><s1>Université Henri Poincaré, LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Aggoun, Abderrahmane" sort="Aggoun, Abderrahmane" uniqKey="Aggoun A" first="Abderrahmane" last="Aggoun">Abderrahmane Aggoun</name>
<affiliation><inist:fA14 i1="02"><s1>COSYTEC S.A., Parc Club Orsay Université 4, rue Jean Rostand</s1>
<s2>91893 Orsay</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">02-0048383</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 02-0048383 INIST</idno>
<idno type="RBID">Pascal:02-0048383</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000903</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Network flow problems in constraint programming</title>
<author><name sortKey="Bockmayr, Alexander" sort="Bockmayr, Alexander" uniqKey="Bockmayr A" first="Alexander" last="Bockmayr">Alexander Bockmayr</name>
<affiliation><inist:fA14 i1="01"><s1>Université Henri Poincaré, LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Pisaruk, Nicolai" sort="Pisaruk, Nicolai" uniqKey="Pisaruk N" first="Nicolai" last="Pisaruk">Nicolai Pisaruk</name>
<affiliation><inist:fA14 i1="01"><s1>Université Henri Poincaré, LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Aggoun, Abderrahmane" sort="Aggoun, Abderrahmane" uniqKey="Aggoun A" first="Abderrahmane" last="Aggoun">Abderrahmane Aggoun</name>
<affiliation><inist:fA14 i1="02"><s1>COSYTEC S.A., Parc Club Orsay Université 4, rue Jean Rostand</s1>
<s2>91893 Orsay</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2001">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Constraint logic programming</term>
<term>Network flow</term>
<term>Operational semantics</term>
<term>Problem solving</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Flot réseau</term>
<term>Sémantique opérationnelle</term>
<term>Programmation logique avec contrainte</term>
<term>Résolution problème</term>
<term>Sémantique déclarative</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2239</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Network flow problems in constraint programming</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>CP 2001 : principles and practice of constraint programming : Paphos, 26 November - 1 December 2001</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>BOCKMAYR (Alexander)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>PISARUK (Nicolai)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>AGGOUN (Abderrahmane)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>WALSH (Toby)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Université Henri Poincaré, LORIA, B.P. 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>COSYTEC S.A., Parc Club Orsay Université 4, rue Jean Rostand</s1>
<s2>91893 Orsay</s2>
<s3>FRA</s3>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>196-210</s1>
</fA20>
<fA21><s1>2001</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-42863-1</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000097041240140</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2002 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>17 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>02-0048383</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02A07</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Flot réseau</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Network flow</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Flujo red</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Sémantique opérationnelle</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Operational semantics</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Semantica operacional</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Programmation logique avec contrainte</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Constraint logic programming</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Programación lógica con restricción</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Résolution problème</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Problem solving</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Resolución problema</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Sémantique déclarative</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>021</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on principles and practice of constriant programming</s1>
<s2>7</s2>
<s3>Paphos CYP</s3>
<s4>2001-11-26</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 02-0048383 INIST</NO>
<ET>Network flow problems in constraint programming</ET>
<AU>BOCKMAYR (Alexander); PISARUK (Nicolai); AGGOUN (Abderrahmane); WALSH (Toby)</AU>
<AF>Université Henri Poincaré, LORIA, B.P. 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.); COSYTEC S.A., Parc Club Orsay Université 4, rue Jean Rostand/91893 Orsay/France (3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2001; Vol. 2239; Pp. 196-210; Bibl. 17 ref.</SO>
<LA>Anglais</LA>
<EA>We introduce a new global constraint for modeling and solving network flow problems in constraint programming. We describe the declarative and operational semantics of the flow constraint and illustrate its use through a number of applications.</EA>
<CC>001D02A07</CC>
<FD>Flot réseau; Sémantique opérationnelle; Programmation logique avec contrainte; Résolution problème; Sémantique déclarative</FD>
<ED>Network flow; Operational semantics; Constraint logic programming; Problem solving</ED>
<SD>Flujo red; Semantica operacional; Programación lógica con restricción; Resolución problema</SD>
<LO>INIST-16343.354000097041240140</LO>
<ID>02-0048383</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

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

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

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000903 | SxmlIndent | more

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:02-0048383
   |texte=   Network flow problems in constraint 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

Network flow problems in constraint programming

Network flow problems in constraint programming

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

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