Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Hadjiat:1998:PGH,
author = "Malika Hadjiat",
title = "{Penelope}'s graph: a hard minimum cost tension
instance",
journal = j-THEOR-COMP-SCI,
volume = "194",
number = "1--2",
pages = "207--218",
day = "10",
month = mar,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:39 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=194&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/194/1-2/2722.pdf",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C1180
(Optimisation techniques)",
conftitle = "Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting
and Computation (SEGRAGRA '95) (papers in summary form
only received)",
corpsource = "Lab. d'Inf., CNRS, Marseille, France",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "directed graphs; duality; duality (mathematics); graph
theory; iterations; Minimum Cost Tension problem;
network combinatorial optimization; optimisation;
out-of-kilter method; tension",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}