Entry Hadjiat:1998:PGH from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@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",
}
Related entries
- C1180,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
196(1)365,
197(1)245-2
- cost,
144(1)199,
156(1)301,
156(1)315,
164(1)185,
165(2)441,
168(1)21,
173(1)113,
181(1)75,
182(1)203,
182(1)233,
191(1)229,
196(1)241,
219(1)301
- directed,
127(2)287,
143(1)73,
151(2)385,
152(1)67,
154(2)247,
154(2)379,
157(2)215,
158(1)81,
158(1)343,
159(1)65,
159(1)129,
159(2)343,
168(1)121,
171(1)3,
174(1)97,
175(2)393,
178(1)103,
178(1)129,
194(1)246,
203(1)143,
221(1)119
- duality,
151(1)3,
151(1)79,
151(1)z,
153(1)271,
197(1)243-1,
202(1)193
- hard,
157(2)161,
164(1)59,
170(1)129,
181(1)107
- instance,
149(2)231,
160(1)217,
161(1)123,
166(1)221,
179(1)301
- iteration,
150(1)57,
168(2)405,
177(1)217,
177(2)407,
188(1)161,
195(1)61,
211(1)339
- minimum,
140(2)291,
147(1)69,
158(1)117,
163(1)269,
165(2)311,
174(1)23,
175(2)309,
181(1)57,
181(2)267,
181(2)347,
185(2)319,
188(1)1,
206(1)301,
225(1)113
- optimisation,
137(2)253,
138(1)3,
146(1)69,
146(1)269,
147(1)181,
147(1)267,
148(1)33,
148(2)325,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
162(2)225,
162(2)323,
164(1)1,
164(1)59,
172(1)265,
173(1)3,
174(1)23,
179(1)251,
182(1)217,
188(1)129,
188(1)221,
191(1)193,
191(1)229,
196(1)365,
197(1)245-2
- optimization,
142(1)27,
144(1)125,
145(1)189,
146(1)69,
146(1)145,
146(1)269,
147(1)181,
150(1)1,
156(1)217,
157(2)215,
158(1)117,
158(1)279,
173(1)3,
173(1)113,
174(1)23,
180(1)269,
187(1)231,
191(1)229,
193(1)149,
196(1)365,
207(1)203,
209(1)107,
227(1)299