id	sid	tid	token	lemma	pos
ap-1682	1	1	acta	acta	PROPN
ap-1682	1	2	polytechnica	polytechnica	PROPN
ap-1682	1	3	vol	vol	NOUN
ap-1682	1	4	.	.	PROPN
ap-1682	2	1	52	52	NUM
ap-1682	2	2	no	no	NOUN
ap-1682	2	3	.	.	PUNCT
ap-1682	3	1	6/2012	6/2012	NUM
ap-1682	3	2	global	global	ADJ
ap-1682	3	3	optima	optima	NOUN
ap-1682	3	4	for	for	ADP
ap-1682	3	5	size	size	NOUN
ap-1682	3	6	optimization	optimization	NOUN
ap-1682	3	7	benchmarks	benchmark	NOUN
ap-1682	3	8	by	by	ADP
ap-1682	3	9	branch	branch	NOUN
ap-1682	3	10	and	and	CCONJ
ap-1682	3	11	bound	bind	VERB
ap-1682	3	12	principles	principle	NOUN
ap-1682	3	13	adéla	adéla	VERB
ap-1682	3	14	pospíšilová	pospíšilová	PROPN
ap-1682	3	15	,	,	PUNCT
ap-1682	3	16	matěj	matěj	PROPN
ap-1682	3	17	lepš	lepš	PROPN
ap-1682	3	18	faculty	faculty	NOUN
ap-1682	3	19	of	of	ADP
ap-1682	3	20	civil	civil	ADJ
ap-1682	3	21	engineering	engineering	NOUN
ap-1682	3	22	,	,	PUNCT
ap-1682	3	23	ctu	ctu	NOUN
ap-1682	3	24	in	in	ADP
ap-1682	3	25	prague	prague	PROPN
ap-1682	3	26	,	,	PUNCT
ap-1682	3	27	thákurova	thákurova	PROPN
ap-1682	3	28	7	7	NUM
ap-1682	3	29	,	,	PUNCT
ap-1682	3	30	166	166	NUM
ap-1682	3	31	29	29	NUM
ap-1682	3	32	prague	prague	NOUN
ap-1682	3	33	,	,	PUNCT
ap-1682	3	34	czech	czech	PROPN
ap-1682	3	35	republic	republic	PROPN
ap-1682	3	36	corresponding	correspond	VERB
ap-1682	3	37	author	author	NOUN
ap-1682	3	38	:	:	PUNCT
ap-1682	3	39	adela.pospisilova@fsv.cvut.cz	adela.pospisilova@fsv.cvut.cz	NUM
ap-1682	3	40	abstract	abstract	ADJ
ap-1682	3	41	this	this	DET
ap-1682	3	42	paper	paper	NOUN
ap-1682	3	43	searches	search	NOUN
ap-1682	3	44	for	for	ADP
ap-1682	3	45	global	global	ADJ
ap-1682	3	46	optima	optima	PROPN
ap-1682	3	47	for	for	ADP
ap-1682	3	48	size	size	NOUN
ap-1682	3	49	optimization	optimization	NOUN
ap-1682	3	50	benchmarks	benchmark	NOUN
ap-1682	3	51	utilizing	utilize	VERB
ap-1682	3	52	a	a	DET
ap-1682	3	53	method	method	NOUN
ap-1682	3	54	based	base	VERB
ap-1682	3	55	on	on	ADP
ap-1682	3	56	branch	branch	NOUN
ap-1682	3	57	and	and	CCONJ
ap-1682	3	58	bound	bind	VERB
ap-1682	3	59	principles	principle	NOUN
ap-1682	3	60	.	.	PUNCT
ap-1682	4	1	the	the	DET
ap-1682	4	2	goal	goal	NOUN
ap-1682	4	3	is	be	AUX
ap-1682	4	4	to	to	PART
ap-1682	4	5	demonstrate	demonstrate	VERB
ap-1682	4	6	the	the	DET
ap-1682	4	7	process	process	NOUN
ap-1682	4	8	for	for	ADP
ap-1682	4	9	finding	find	VERB
ap-1682	4	10	these	these	DET
ap-1682	4	11	global	global	ADJ
ap-1682	4	12	optima	optima	NOUN
ap-1682	4	13	on	on	ADP
ap-1682	4	14	the	the	DET
ap-1682	4	15	basis	basis	NOUN
ap-1682	4	16	of	of	ADP
ap-1682	4	17	two	two	NUM
ap-1682	4	18	examples	example	NOUN
ap-1682	4	19	.	.	PUNCT
ap-1682	5	1	a	a	DET
ap-1682	5	2	suitable	suitable	ADJ
ap-1682	5	3	parallelization	parallelization	NOUN
ap-1682	5	4	strategy	strategy	NOUN
ap-1682	5	5	is	be	AUX
ap-1682	5	6	used	use	VERB
ap-1682	5	7	in	in	ADP
ap-1682	5	8	order	order	NOUN
ap-1682	5	9	to	to	PART
ap-1682	5	10	minimize	minimize	VERB
ap-1682	5	11	the	the	DET
ap-1682	5	12	computational	computational	ADJ
ap-1682	5	13	demands	demand	NOUN
ap-1682	5	14	.	.	PUNCT
ap-1682	6	1	optima	optima	PROPN
ap-1682	6	2	found	find	VERB
ap-1682	6	3	in	in	ADP
ap-1682	6	4	the	the	DET
ap-1682	6	5	literature	literature	NOUN
ap-1682	6	6	are	be	AUX
ap-1682	6	7	compared	compare	VERB
ap-1682	6	8	with	with	ADP
ap-1682	6	9	the	the	DET
ap-1682	6	10	optima	optima	PROPN
ap-1682	6	11	used	use	VERB
ap-1682	6	12	in	in	ADP
ap-1682	6	13	this	this	DET
ap-1682	6	14	work	work	NOUN
ap-1682	6	15	.	.	PUNCT
ap-1682	7	1	keywords	keyword	NOUN
ap-1682	7	2	:	:	PUNCT
ap-1682	7	3	benchmarks	benchmark	NOUN
ap-1682	7	4	,	,	PUNCT
ap-1682	7	5	discrete	discrete	ADJ
ap-1682	7	6	sizing	sizing	NOUN
ap-1682	7	7	optimization	optimization	NOUN
ap-1682	7	8	,	,	PUNCT
ap-1682	7	9	branch	branch	NOUN
ap-1682	7	10	and	and	CCONJ
ap-1682	7	11	bound	bind	VERB
ap-1682	7	12	method	method	NOUN
ap-1682	7	13	,	,	PUNCT
ap-1682	7	14	global	global	ADJ
ap-1682	7	15	optima	optima	PROPN
ap-1682	7	16	,	,	PUNCT
ap-1682	7	17	parallel	parallel	ADJ
ap-1682	7	18	programming	programming	NOUN
ap-1682	7	19	.	.	PUNCT
ap-1682	8	1	1	1	NUM
ap-1682	8	2	introduction	introduction	NOUN
ap-1682	8	3	optimization	optimization	NOUN
ap-1682	8	4	and	and	CCONJ
ap-1682	8	5	search	search	NOUN
ap-1682	8	6	methodologies	methodology	NOUN
ap-1682	8	7	have	have	AUX
ap-1682	8	8	become	become	VERB
ap-1682	8	9	very	very	ADV
ap-1682	8	10	popular	popular	ADJ
ap-1682	8	11	for	for	ADP
ap-1682	8	12	making	make	VERB
ap-1682	8	13	products	product	NOUN
ap-1682	8	14	more	more	ADV
ap-1682	8	15	desirable	desirable	ADJ
ap-1682	8	16	.	.	PUNCT
ap-1682	9	1	the	the	DET
ap-1682	9	2	shape	shape	NOUN
ap-1682	9	3	of	of	ADP
ap-1682	9	4	a	a	DET
ap-1682	9	5	structure	structure	NOUN
ap-1682	9	6	,	,	PUNCT
ap-1682	9	7	the	the	DET
ap-1682	9	8	amount	amount	NOUN
ap-1682	9	9	of	of	ADP
ap-1682	9	10	reinforcement	reinforcement	NOUN
ap-1682	9	11	,	,	PUNCT
ap-1682	9	12	the	the	DET
ap-1682	9	13	cross	cross	NOUN
ap-1682	9	14	-	-	NOUN
ap-1682	9	15	sections	section	NOUN
ap-1682	9	16	,	,	PUNCT
ap-1682	9	17	sheet	sheet	NOUN
ap-1682	9	18	thicknesses	thickness	NOUN
ap-1682	9	19	,	,	PUNCT
ap-1682	9	20	design	design	NOUN
ap-1682	9	21	of	of	ADP
ap-1682	9	22	the	the	DET
ap-1682	9	23	concrete	concrete	ADJ
ap-1682	9	24	mixture	mixture	NOUN
ap-1682	9	25	,	,	PUNCT
ap-1682	9	26	and	and	CCONJ
ap-1682	9	27	many	many	ADJ
ap-1682	9	28	other	other	ADJ
ap-1682	9	29	properties	property	NOUN
ap-1682	9	30	can	can	AUX
ap-1682	9	31	be	be	AUX
ap-1682	9	32	optimized	optimize	VERB
ap-1682	9	33	.	.	PUNCT
ap-1682	10	1	recently	recently	ADV
ap-1682	10	2	,	,	PUNCT
ap-1682	10	3	many	many	ADJ
ap-1682	10	4	heuristic	heuristic	ADJ
ap-1682	10	5	algorithms	algorithm	NOUN
ap-1682	10	6	have	have	AUX
ap-1682	10	7	been	be	AUX
ap-1682	10	8	developed	develop	VERB
ap-1682	10	9	and	and	CCONJ
ap-1682	10	10	tested	test	VERB
ap-1682	10	11	on	on	ADP
ap-1682	10	12	benchmarks	benchmark	NOUN
ap-1682	10	13	in	in	ADP
ap-1682	10	14	order	order	NOUN
ap-1682	10	15	to	to	PART
ap-1682	10	16	assess	assess	VERB
ap-1682	10	17	their	their	PRON
ap-1682	10	18	performance	performance	NOUN
ap-1682	10	19	.	.	PUNCT
ap-1682	11	1	in	in	ADP
ap-1682	11	2	order	order	NOUN
ap-1682	11	3	to	to	PART
ap-1682	11	4	compare	compare	VERB
ap-1682	11	5	different	different	ADJ
ap-1682	11	6	optimization	optimization	NOUN
ap-1682	11	7	methods	method	NOUN
ap-1682	11	8	,	,	PUNCT
ap-1682	11	9	it	it	PRON
ap-1682	11	10	is	be	AUX
ap-1682	11	11	necessary	necessary	ADJ
ap-1682	11	12	to	to	PART
ap-1682	11	13	have	have	VERB
ap-1682	11	14	reliable	reliable	ADJ
ap-1682	11	15	information	information	NOUN
ap-1682	11	16	on	on	ADP
ap-1682	11	17	the	the	DET
ap-1682	11	18	global	global	ADJ
ap-1682	11	19	optima	optima	NOUN
ap-1682	11	20	of	of	ADP
ap-1682	11	21	the	the	DET
ap-1682	11	22	benchmarks	benchmark	NOUN
ap-1682	11	23	.	.	PUNCT
ap-1682	12	1	in	in	ADP
ap-1682	12	2	the	the	DET
ap-1682	12	3	past	past	NOUN
ap-1682	12	4	,	,	PUNCT
ap-1682	12	5	it	it	PRON
ap-1682	12	6	was	be	AUX
ap-1682	12	7	not	not	PART
ap-1682	12	8	possible	possible	ADJ
ap-1682	12	9	to	to	PART
ap-1682	12	10	obtain	obtain	VERB
ap-1682	12	11	these	these	DET
ap-1682	12	12	optima	optima	NOUN
ap-1682	12	13	by	by	ADP
ap-1682	12	14	exhaustive	exhaustive	ADJ
ap-1682	12	15	search	search	NOUN
ap-1682	12	16	approaches	approach	NOUN
ap-1682	12	17	,	,	PUNCT
ap-1682	12	18	due	due	ADP
ap-1682	12	19	to	to	ADP
ap-1682	12	20	the	the	DET
ap-1682	12	21	large	large	ADJ
ap-1682	12	22	computational	computational	ADJ
ap-1682	12	23	demands	demand	NOUN
ap-1682	12	24	.	.	PUNCT
ap-1682	13	1	as	as	SCONJ
ap-1682	13	2	computational	computational	ADJ
ap-1682	13	3	power	power	NOUN
ap-1682	13	4	is	be	AUX
ap-1682	13	5	growing	grow	VERB
ap-1682	13	6	year	year	NOUN
ap-1682	13	7	by	by	ADP
ap-1682	13	8	year	year	NOUN
ap-1682	13	9	,	,	PUNCT
ap-1682	13	10	it	it	PRON
ap-1682	13	11	now	now	ADV
ap-1682	13	12	seems	seem	VERB
ap-1682	13	13	to	to	PART
ap-1682	13	14	be	be	AUX
ap-1682	13	15	the	the	DET
ap-1682	13	16	right	right	ADJ
ap-1682	13	17	time	time	NOUN
ap-1682	13	18	to	to	PART
ap-1682	13	19	deal	deal	VERB
ap-1682	13	20	with	with	ADP
ap-1682	13	21	this	this	DET
ap-1682	13	22	issue	issue	NOUN
ap-1682	13	23	.	.	PUNCT
ap-1682	14	1	this	this	DET
ap-1682	14	2	paper	paper	NOUN
ap-1682	14	3	outlines	outline	VERB
ap-1682	14	4	a	a	DET
ap-1682	14	5	process	process	NOUN
ap-1682	14	6	for	for	ADP
ap-1682	14	7	searching	search	VERB
ap-1682	14	8	global	global	ADJ
ap-1682	14	9	optima	optima	NOUN
ap-1682	14	10	for	for	ADP
ap-1682	14	11	sizing	size	VERB
ap-1682	14	12	discrete	discrete	ADJ
ap-1682	14	13	optimization	optimization	NOUN
ap-1682	14	14	benchmarks	benchmark	NOUN
ap-1682	14	15	.	.	PUNCT
ap-1682	15	1	various	various	ADJ
ap-1682	15	2	optimization	optimization	NOUN
ap-1682	15	3	methods	method	NOUN
ap-1682	15	4	can	can	AUX
ap-1682	15	5	be	be	AUX
ap-1682	15	6	used	use	VERB
ap-1682	15	7	for	for	ADP
ap-1682	15	8	obtaining	obtain	VERB
ap-1682	15	9	optima	optima	NOUN
ap-1682	15	10	,	,	PUNCT
ap-1682	15	11	e.g.	e.g.	ADV
ap-1682	15	12	gradient	gradient	ADJ
ap-1682	15	13	methods	method	NOUN
ap-1682	15	14	[	[	X
ap-1682	15	15	1	1	NUM
ap-1682	15	16	]	]	PUNCT
ap-1682	15	17	,	,	PUNCT
ap-1682	15	18	heuristic	heuristic	ADJ
ap-1682	15	19	methods	method	NOUN
ap-1682	15	20	,	,	PUNCT
ap-1682	15	21	and	and	CCONJ
ap-1682	15	22	evolutionary	evolutionary	ADJ
ap-1682	15	23	algorithms	algorithm	NOUN
ap-1682	15	24	[	[	X
ap-1682	15	25	2	2	NUM
ap-1682	15	26	]	]	PUNCT
ap-1682	15	27	.	.	PUNCT
ap-1682	16	1	these	these	DET
ap-1682	16	2	methods	method	NOUN
ap-1682	16	3	do	do	AUX
ap-1682	16	4	not	not	PART
ap-1682	16	5	guarantee	guarantee	VERB
ap-1682	16	6	that	that	SCONJ
ap-1682	16	7	a	a	DET
ap-1682	16	8	global	global	ADJ
ap-1682	16	9	optimum	optimum	NOUN
ap-1682	16	10	is	be	AUX
ap-1682	16	11	obtained	obtain	VERB
ap-1682	16	12	because	because	SCONJ
ap-1682	16	13	only	only	ADV
ap-1682	16	14	a	a	DET
ap-1682	16	15	portion	portion	NOUN
ap-1682	16	16	of	of	ADP
ap-1682	16	17	the	the	DET
ap-1682	16	18	space	space	NOUN
ap-1682	16	19	is	be	AUX
ap-1682	16	20	explored	explore	VERB
ap-1682	16	21	.	.	PUNCT
ap-1682	17	1	it	it	PRON
ap-1682	17	2	is	be	AUX
ap-1682	17	3	not	not	PART
ap-1682	17	4	always	always	ADV
ap-1682	17	5	necessary	necessary	ADJ
ap-1682	17	6	to	to	PART
ap-1682	17	7	obtain	obtain	VERB
ap-1682	17	8	the	the	DET
ap-1682	17	9	global	global	ADJ
ap-1682	17	10	optimum	optimum	NOUN
ap-1682	17	11	.	.	PUNCT
ap-1682	18	1	a	a	DET
ap-1682	18	2	local	local	ADJ
ap-1682	18	3	optimum	optimum	NOUN
ap-1682	18	4	with	with	ADP
ap-1682	18	5	good	good	ADJ
ap-1682	18	6	qualities	quality	NOUN
ap-1682	18	7	found	find	VERB
ap-1682	18	8	within	within	ADP
ap-1682	18	9	a	a	DET
ap-1682	18	10	short	short	ADJ
ap-1682	18	11	time	time	NOUN
ap-1682	18	12	can	can	AUX
ap-1682	18	13	be	be	AUX
ap-1682	18	14	considered	consider	VERB
ap-1682	18	15	as	as	ADP
ap-1682	18	16	a	a	DET
ap-1682	18	17	mark	mark	NOUN
ap-1682	18	18	of	of	ADP
ap-1682	18	19	a	a	DET
ap-1682	18	20	high	high	ADJ
ap-1682	18	21	quality	quality	NOUN
ap-1682	18	22	algorithm	algorithm	NOUN
ap-1682	18	23	.	.	PUNCT
ap-1682	19	1	however	however	ADV
ap-1682	19	2	,	,	PUNCT
ap-1682	19	3	without	without	ADP
ap-1682	19	4	knowledge	knowledge	NOUN
ap-1682	19	5	of	of	ADP
ap-1682	19	6	the	the	DET
ap-1682	19	7	global	global	ADJ
ap-1682	19	8	optima	optima	NOUN
ap-1682	19	9	for	for	ADP
ap-1682	19	10	selected	select	VERB
ap-1682	19	11	benchmarks	benchmark	NOUN
ap-1682	19	12	,	,	PUNCT
ap-1682	19	13	it	it	PRON
ap-1682	19	14	is	be	AUX
ap-1682	19	15	not	not	PART
ap-1682	19	16	possible	possible	ADJ
ap-1682	19	17	to	to	PART
ap-1682	19	18	make	make	VERB
ap-1682	19	19	a	a	DET
ap-1682	19	20	reliable	reliable	ADJ
ap-1682	19	21	assessment	assessment	NOUN
ap-1682	19	22	of	of	ADP
ap-1682	19	23	the	the	DET
ap-1682	19	24	performance	performance	NOUN
ap-1682	19	25	of	of	ADP
ap-1682	19	26	the	the	DET
ap-1682	19	27	methodology	methodology	NOUN
ap-1682	19	28	that	that	PRON
ap-1682	19	29	is	be	AUX
ap-1682	19	30	used	use	VERB
ap-1682	19	31	.	.	PUNCT
ap-1682	20	1	in	in	ADP
ap-1682	20	2	our	our	PRON
ap-1682	20	3	work	work	NOUN
ap-1682	20	4	,	,	PUNCT
ap-1682	20	5	we	we	PRON
ap-1682	20	6	look	look	VERB
ap-1682	20	7	for	for	ADP
ap-1682	20	8	global	global	ADJ
ap-1682	20	9	optima	optima	NOUN
ap-1682	20	10	for	for	ADP
ap-1682	20	11	some	some	DET
ap-1682	20	12	fundamental	fundamental	ADJ
ap-1682	20	13	benchmarks	benchmark	NOUN
ap-1682	20	14	,	,	PUNCT
ap-1682	20	15	using	use	VERB
ap-1682	20	16	a	a	DET
ap-1682	20	17	method	method	NOUN
ap-1682	20	18	based	base	VERB
ap-1682	20	19	on	on	ADP
ap-1682	20	20	branch	branch	NOUN
ap-1682	20	21	and	and	CCONJ
ap-1682	20	22	bound	bind	VERB
ap-1682	20	23	principles	principle	NOUN
ap-1682	20	24	.	.	PUNCT
ap-1682	21	1	this	this	DET
ap-1682	21	2	approach	approach	NOUN
ap-1682	21	3	requires	require	VERB
ap-1682	21	4	two	two	NUM
ap-1682	21	5	values	value	NOUN
ap-1682	21	6	called	call	VERB
ap-1682	21	7	bounds	bound	NOUN
ap-1682	21	8	for	for	ADP
ap-1682	21	9	determining	determine	VERB
ap-1682	21	10	the	the	DET
ap-1682	21	11	searched	searched	ADJ
ap-1682	21	12	space	space	NOUN
ap-1682	21	13	.	.	PUNCT
ap-1682	22	1	a	a	DET
ap-1682	22	2	good	good	ADJ
ap-1682	22	3	estimate	estimate	NOUN
ap-1682	22	4	of	of	ADP
ap-1682	22	5	these	these	DET
ap-1682	22	6	bounds	bound	NOUN
ap-1682	22	7	reduces	reduce	VERB
ap-1682	22	8	the	the	DET
ap-1682	22	9	searched	searched	ADJ
ap-1682	22	10	space	space	NOUN
ap-1682	22	11	but	but	CCONJ
ap-1682	22	12	still	still	ADV
ap-1682	22	13	ensures	ensure	VERB
ap-1682	22	14	that	that	SCONJ
ap-1682	22	15	global	global	ADJ
ap-1682	22	16	optima	optima	PROPN
ap-1682	22	17	can	can	AUX
ap-1682	22	18	be	be	AUX
ap-1682	22	19	found	find	VERB
ap-1682	22	20	.	.	PUNCT
ap-1682	23	1	the	the	DET
ap-1682	23	2	optimization	optimization	NOUN
ap-1682	23	3	problem	problem	NOUN
ap-1682	23	4	for	for	ADP
ap-1682	23	5	the	the	DET
ap-1682	23	6	benchmarks	benchmark	NOUN
ap-1682	23	7	presented	present	VERB
ap-1682	23	8	in	in	ADP
ap-1682	23	9	this	this	DET
ap-1682	23	10	paper	paper	NOUN
ap-1682	23	11	is	be	AUX
ap-1682	23	12	defined	define	VERB
ap-1682	23	13	by	by	ADP
ap-1682	23	14	an	an	DET
ap-1682	23	15	objective	objective	ADJ
ap-1682	23	16	function	function	NOUN
ap-1682	23	17	that	that	PRON
ap-1682	23	18	is	be	AUX
ap-1682	23	19	easy	easy	ADJ
ap-1682	23	20	to	to	PART
ap-1682	23	21	solve	solve	VERB
ap-1682	23	22	,	,	PUNCT
ap-1682	23	23	constraints	constraint	NOUN
ap-1682	23	24	with	with	ADP
ap-1682	23	25	high	high	ADJ
ap-1682	23	26	computational	computational	ADJ
ap-1682	23	27	demands	demand	NOUN
ap-1682	23	28	and	and	CCONJ
ap-1682	23	29	with	with	ADP
ap-1682	23	30	a	a	DET
ap-1682	23	31	searched	search	VERB
ap-1682	23	32	space	space	NOUN
ap-1682	23	33	that	that	PRON
ap-1682	23	34	is	be	AUX
ap-1682	23	35	discrete	discrete	ADJ
ap-1682	23	36	and	and	CCONJ
ap-1682	23	37	huge	huge	ADJ
ap-1682	23	38	.	.	PUNCT
ap-1682	24	1	the	the	DET
ap-1682	24	2	algorithm	algorithm	NOUN
ap-1682	24	3	presented	present	VERB
ap-1682	24	4	here	here	ADV
ap-1682	24	5	can	can	AUX
ap-1682	24	6	be	be	AUX
ap-1682	24	7	used	use	VERB
ap-1682	24	8	for	for	ADP
ap-1682	24	9	obtaining	obtain	VERB
ap-1682	24	10	the	the	DET
ap-1682	24	11	global	global	ADJ
ap-1682	24	12	optimum	optimum	NOUN
ap-1682	24	13	for	for	ADP
ap-1682	24	14	problems	problem	NOUN
ap-1682	24	15	similar	similar	ADJ
ap-1682	24	16	to	to	ADP
ap-1682	24	17	those	those	PRON
ap-1682	24	18	discussed	discuss	VERB
ap-1682	24	19	in	in	ADP
ap-1682	24	20	this	this	DET
ap-1682	24	21	paper	paper	NOUN
ap-1682	24	22	.	.	PUNCT
ap-1682	25	1	2	2	NUM
ap-1682	25	2	sizing	size	VERB
ap-1682	25	3	optimization	optimization	NOUN
ap-1682	25	4	sizing	size	VERB
ap-1682	25	5	optimization	optimization	NOUN
ap-1682	25	6	[	[	X
ap-1682	25	7	3	3	X
ap-1682	25	8	]	]	PUNCT
ap-1682	25	9	is	be	AUX
ap-1682	25	10	a	a	DET
ap-1682	25	11	type	type	NOUN
ap-1682	25	12	of	of	ADP
ap-1682	25	13	structural	structural	ADJ
ap-1682	25	14	optimization	optimization	NOUN
ap-1682	25	15	that	that	PRON
ap-1682	25	16	deals	deal	VERB
ap-1682	25	17	with	with	ADP
ap-1682	25	18	truss	truss	NOUN
ap-1682	25	19	-	-	PUNCT
ap-1682	25	20	like	like	ADJ
ap-1682	25	21	structures	structure	NOUN
ap-1682	25	22	.	.	PUNCT
ap-1682	26	1	these	these	DET
ap-1682	26	2	structures	structure	NOUN
ap-1682	26	3	are	be	AUX
ap-1682	26	4	defined	define	VERB
ap-1682	26	5	by	by	ADP
ap-1682	26	6	a	a	DET
ap-1682	26	7	fixed	fix	VERB
ap-1682	26	8	topology	topology	NOUN
ap-1682	26	9	,	,	PUNCT
ap-1682	26	10	material	material	NOUN
ap-1682	26	11	,	,	PUNCT
ap-1682	26	12	loading	loading	NOUN
ap-1682	26	13	,	,	PUNCT
ap-1682	26	14	supports	support	NOUN
ap-1682	26	15	,	,	PUNCT
ap-1682	26	16	and	and	CCONJ
ap-1682	26	17	a	a	DET
ap-1682	26	18	set	set	NOUN
ap-1682	26	19	of	of	ADP
ap-1682	26	20	cross	cross	NOUN
ap-1682	26	21	-	-	NOUN
ap-1682	26	22	sections	section	NOUN
ap-1682	26	23	or	or	CCONJ
ap-1682	26	24	,	,	PUNCT
ap-1682	26	25	alternatively	alternatively	ADV
ap-1682	26	26	,	,	PUNCT
ap-1682	26	27	minimum	minimum	ADJ
ap-1682	26	28	and	and	CCONJ
ap-1682	26	29	maximum	maximum	ADJ
ap-1682	26	30	cross	cross	ADJ
ap-1682	26	31	-	-	ADJ
ap-1682	26	32	sectional	sectional	ADJ
ap-1682	26	33	areas	area	NOUN
ap-1682	26	34	of	of	ADP
ap-1682	26	35	individual	individual	ADJ
ap-1682	26	36	truss	truss	NOUN
ap-1682	26	37	bars	bar	NOUN
ap-1682	26	38	.	.	PUNCT
ap-1682	27	1	the	the	DET
ap-1682	27	2	objective	objective	ADJ
ap-1682	27	3	function	function	NOUN
ap-1682	27	4	is	be	AUX
ap-1682	27	5	the	the	DET
ap-1682	27	6	weight	weight	NOUN
ap-1682	27	7	of	of	ADP
ap-1682	27	8	the	the	DET
ap-1682	27	9	structure	structure	NOUN
ap-1682	27	10	or	or	CCONJ
ap-1682	27	11	its	its	PRON
ap-1682	27	12	volume	volume	NOUN
ap-1682	27	13	.	.	PUNCT
ap-1682	28	1	the	the	DET
ap-1682	28	2	objective	objective	ADJ
ap-1682	28	3	function	function	NOUN
ap-1682	28	4	is	be	AUX
ap-1682	28	5	linear	linear	ADJ
ap-1682	28	6	and	and	CCONJ
ap-1682	28	7	easy	easy	ADJ
ap-1682	28	8	to	to	PART
ap-1682	28	9	solve	solve	VERB
ap-1682	28	10	.	.	PUNCT
ap-1682	29	1	constraints	constraint	NOUN
ap-1682	29	2	are	be	AUX
ap-1682	29	3	maximum	maximum	ADJ
ap-1682	29	4	stresses	stress	NOUN
ap-1682	29	5	and	and	CCONJ
ap-1682	29	6	maximum	maximum	ADJ
ap-1682	29	7	displacements	displacement	NOUN
ap-1682	29	8	,	,	PUNCT
ap-1682	29	9	respectively	respectively	ADV
ap-1682	29	10	.	.	PUNCT
ap-1682	30	1	these	these	DET
ap-1682	30	2	functions	function	NOUN
ap-1682	30	3	are	be	AUX
ap-1682	30	4	non	non	ADJ
ap-1682	30	5	-	-	ADJ
ap-1682	30	6	convex	convex	ADJ
ap-1682	30	7	in	in	ADP
ap-1682	30	8	the	the	DET
ap-1682	30	9	most	most	ADJ
ap-1682	30	10	cases	case	NOUN
ap-1682	30	11	,	,	PUNCT
ap-1682	30	12	and	and	CCONJ
ap-1682	30	13	it	it	PRON
ap-1682	30	14	is	be	AUX
ap-1682	30	15	more	more	ADJ
ap-1682	30	16	time	time	NOUN
ap-1682	30	17	-	-	PUNCT
ap-1682	30	18	consuming	consume	VERB
ap-1682	30	19	to	to	PART
ap-1682	30	20	solve	solve	VERB
ap-1682	30	21	them	they	PRON
ap-1682	30	22	that	that	PRON
ap-1682	30	23	to	to	PART
ap-1682	30	24	solve	solve	VERB
ap-1682	30	25	the	the	DET
ap-1682	30	26	objective	objective	ADJ
ap-1682	30	27	function	function	NOUN
ap-1682	30	28	.	.	PUNCT
ap-1682	31	1	the	the	DET
ap-1682	31	2	goal	goal	NOUN
ap-1682	31	3	is	be	AUX
ap-1682	31	4	to	to	PART
ap-1682	31	5	find	find	VERB
ap-1682	31	6	sections	section	NOUN
ap-1682	31	7	for	for	ADP
ap-1682	31	8	a	a	DET
ap-1682	31	9	given	give	VERB
ap-1682	31	10	structure	structure	NOUN
ap-1682	31	11	that	that	PRON
ap-1682	31	12	satisfy	satisfy	VERB
ap-1682	31	13	the	the	DET
ap-1682	31	14	prescribed	prescribed	ADJ
ap-1682	31	15	constraints	constraint	NOUN
ap-1682	31	16	and	and	CCONJ
ap-1682	31	17	have	have	VERB
ap-1682	31	18	the	the	DET
ap-1682	31	19	lowest	low	ADJ
ap-1682	31	20	possible	possible	ADJ
ap-1682	31	21	weight	weight	NOUN
ap-1682	31	22	.	.	PUNCT
ap-1682	32	1	the	the	DET
ap-1682	32	2	selection	selection	NOUN
ap-1682	32	3	of	of	ADP
ap-1682	32	4	cross	cross	NOUN
ap-1682	32	5	-	-	NOUN
ap-1682	32	6	sections	section	NOUN
ap-1682	32	7	from	from	ADP
ap-1682	32	8	the	the	DET
ap-1682	32	9	given	give	VERB
ap-1682	32	10	database	database	NOUN
ap-1682	32	11	then	then	ADV
ap-1682	32	12	defines	define	VERB
ap-1682	32	13	a	a	DET
ap-1682	32	14	discrete	discrete	ADJ
ap-1682	32	15	optimization	optimization	NOUN
ap-1682	32	16	problem	problem	NOUN
ap-1682	32	17	,	,	PUNCT
ap-1682	32	18	and	and	CCONJ
ap-1682	32	19	variables	variable	NOUN
ap-1682	32	20	chosen	choose	VERB
ap-1682	32	21	from	from	ADP
ap-1682	32	22	given	give	VERB
ap-1682	32	23	limits	limit	NOUN
ap-1682	32	24	lead	lead	VERB
ap-1682	32	25	to	to	ADP
ap-1682	32	26	a	a	DET
ap-1682	32	27	continuous	continuous	ADJ
ap-1682	32	28	case	case	NOUN
ap-1682	32	29	.	.	PUNCT
ap-1682	33	1	the	the	DET
ap-1682	33	2	continuous	continuous	ADJ
ap-1682	33	3	optimization	optimization	NOUN
ap-1682	33	4	problem	problem	NOUN
ap-1682	33	5	can	can	AUX
ap-1682	33	6	be	be	AUX
ap-1682	33	7	efficiently	efficiently	ADV
ap-1682	33	8	solved	solve	VERB
ap-1682	33	9	by	by	ADP
ap-1682	33	10	mathematical	mathematical	ADJ
ap-1682	33	11	programming	programming	NOUN
ap-1682	33	12	methods	method	NOUN
ap-1682	33	13	,	,	PUNCT
ap-1682	33	14	e.g.	e.g.	ADV
ap-1682	33	15	gradient	gradient	NOUN
ap-1682	33	16	-	-	PUNCT
ap-1682	33	17	based	base	VERB
ap-1682	33	18	methods	method	NOUN
ap-1682	33	19	,	,	PUNCT
ap-1682	33	20	as	as	SCONJ
ap-1682	33	21	will	will	AUX
ap-1682	33	22	be	be	AUX
ap-1682	33	23	shown	show	VERB
ap-1682	33	24	below	below	ADP
ap-1682	33	25	.	.	PUNCT
ap-1682	34	1	when	when	SCONJ
ap-1682	34	2	using	use	VERB
ap-1682	34	3	discrete	discrete	ADJ
ap-1682	34	4	variables	variable	NOUN
ap-1682	34	5	,	,	PUNCT
ap-1682	34	6	no	no	DET
ap-1682	34	7	such	such	ADJ
ap-1682	34	8	option	option	NOUN
ap-1682	34	9	is	be	AUX
ap-1682	34	10	available	available	ADJ
ap-1682	34	11	.	.	PUNCT
ap-1682	35	1	thus	thus	ADV
ap-1682	35	2	we	we	PRON
ap-1682	35	3	first	first	ADV
ap-1682	35	4	give	give	VERB
ap-1682	35	5	our	our	PRON
ap-1682	35	6	attention	attention	NOUN
ap-1682	35	7	to	to	ADP
ap-1682	35	8	the	the	DET
ap-1682	35	9	discrete	discrete	ADJ
ap-1682	35	10	case	case	NOUN
ap-1682	35	11	.	.	PUNCT
ap-1682	36	1	74	74	NUM
ap-1682	36	2	acta	acta	PROPN
ap-1682	36	3	polytechnica	polytechnica	PROPN
ap-1682	36	4	vol	vol	NOUN
ap-1682	36	5	.	.	PROPN
ap-1682	37	1	52	52	NUM
ap-1682	37	2	no	no	NOUN
ap-1682	37	3	.	.	PUNCT
ap-1682	38	1	6/2012	6/2012	NUM
ap-1682	38	2	3	3	NUM
ap-1682	38	3	discrete	discrete	ADJ
ap-1682	38	4	problem	problem	NOUN
ap-1682	38	5	the	the	DET
ap-1682	38	6	goal	goal	NOUN
ap-1682	38	7	is	be	AUX
ap-1682	38	8	to	to	PART
ap-1682	38	9	find	find	VERB
ap-1682	38	10	a	a	DET
ap-1682	38	11	combination	combination	NOUN
ap-1682	38	12	of	of	ADP
ap-1682	38	13	cross	cross	NOUN
ap-1682	38	14	-	-	NOUN
ap-1682	38	15	sections	section	NOUN
ap-1682	38	16	from	from	ADP
ap-1682	38	17	the	the	DET
ap-1682	38	18	given	give	VERB
ap-1682	38	19	list	list	NOUN
ap-1682	38	20	of	of	ADP
ap-1682	38	21	profiles	profile	NOUN
ap-1682	38	22	that	that	PRON
ap-1682	38	23	leads	lead	VERB
ap-1682	38	24	to	to	ADP
ap-1682	38	25	the	the	DET
ap-1682	38	26	lowest	low	ADJ
ap-1682	38	27	possible	possible	ADJ
ap-1682	38	28	weight	weight	NOUN
ap-1682	38	29	,	,	PUNCT
ap-1682	38	30	while	while	SCONJ
ap-1682	38	31	still	still	ADV
ap-1682	38	32	fulfilling	fulfil	VERB
ap-1682	38	33	the	the	DET
ap-1682	38	34	given	give	VERB
ap-1682	38	35	constraints	constraint	NOUN
ap-1682	38	36	.	.	PUNCT
ap-1682	39	1	we	we	PRON
ap-1682	39	2	present	present	VERB
ap-1682	39	3	two	two	NUM
ap-1682	39	4	methods	method	NOUN
ap-1682	39	5	that	that	PRON
ap-1682	39	6	are	be	AUX
ap-1682	39	7	able	able	ADJ
ap-1682	39	8	to	to	PART
ap-1682	39	9	find	find	VERB
ap-1682	39	10	global	global	ADJ
ap-1682	39	11	optima	optima	NOUN
ap-1682	39	12	for	for	ADP
ap-1682	39	13	this	this	DET
ap-1682	39	14	discrete	discrete	ADJ
ap-1682	39	15	optimization	optimization	NOUN
ap-1682	39	16	problem	problem	NOUN
ap-1682	39	17	.	.	PUNCT
ap-1682	40	1	3.1	3.1	NUM
ap-1682	40	2	enumeration	enumeration	NOUN
ap-1682	40	3	enumeration	enumeration	NOUN
ap-1682	40	4	(	(	PUNCT
ap-1682	40	5	also	also	ADV
ap-1682	40	6	called	call	VERB
ap-1682	40	7	a	a	DET
ap-1682	40	8	brutal	brutal	ADJ
ap-1682	40	9	force	force	NOUN
ap-1682	40	10	or	or	CCONJ
ap-1682	40	11	exhaustive	exhaustive	ADJ
ap-1682	40	12	search	search	NOUN
ap-1682	40	13	)	)	PUNCT
ap-1682	40	14	is	be	AUX
ap-1682	40	15	the	the	DET
ap-1682	40	16	simplest	simple	ADJ
ap-1682	40	17	method	method	NOUN
ap-1682	40	18	for	for	ADP
ap-1682	40	19	obtaining	obtain	VERB
ap-1682	40	20	a	a	DET
ap-1682	40	21	global	global	ADJ
ap-1682	40	22	optimum	optimum	NOUN
ap-1682	40	23	of	of	ADP
ap-1682	40	24	the	the	DET
ap-1682	40	25	discrete	discrete	ADJ
ap-1682	40	26	optimization	optimization	NOUN
ap-1682	40	27	problem	problem	NOUN
ap-1682	40	28	.	.	PUNCT
ap-1682	41	1	here	here	ADV
ap-1682	41	2	,	,	PUNCT
ap-1682	41	3	it	it	PRON
ap-1682	41	4	is	be	AUX
ap-1682	41	5	necessary	necessary	ADJ
ap-1682	41	6	to	to	PART
ap-1682	41	7	compute	compute	VERB
ap-1682	41	8	values	value	NOUN
ap-1682	41	9	of	of	ADP
ap-1682	41	10	an	an	DET
ap-1682	41	11	objective	objective	ADJ
ap-1682	41	12	function	function	NOUN
ap-1682	41	13	and	and	CCONJ
ap-1682	41	14	constraints	constraint	NOUN
ap-1682	41	15	for	for	ADP
ap-1682	41	16	every	every	DET
ap-1682	41	17	combination	combination	NOUN
ap-1682	41	18	of	of	ADP
ap-1682	41	19	crosssections	crosssection	NOUN
ap-1682	41	20	from	from	ADP
ap-1682	41	21	a	a	DET
ap-1682	41	22	given	give	VERB
ap-1682	41	23	set	set	NOUN
ap-1682	41	24	.	.	PUNCT
ap-1682	42	1	the	the	DET
ap-1682	42	2	enumeration	enumeration	NOUN
ap-1682	42	3	therefore	therefore	ADV
ap-1682	42	4	poses	pose	VERB
ap-1682	42	5	very	very	ADV
ap-1682	42	6	large	large	ADJ
ap-1682	42	7	computational	computational	ADJ
ap-1682	42	8	demands	demand	NOUN
ap-1682	42	9	.	.	PUNCT
ap-1682	43	1	if	if	SCONJ
ap-1682	43	2	there	there	PRON
ap-1682	43	3	are	be	VERB
ap-1682	43	4	n	n	DET
ap-1682	43	5	sections	section	NOUN
ap-1682	43	6	and	and	CCONJ
ap-1682	43	7	k	k	PROPN
ap-1682	43	8	variables	variable	NOUN
ap-1682	43	9	(	(	PUNCT
ap-1682	43	10	i.e.	i.e.	X
ap-1682	43	11	,	,	PUNCT
ap-1682	43	12	truss	truss	ADJ
ap-1682	43	13	bars	bar	NOUN
ap-1682	43	14	or	or	CCONJ
ap-1682	43	15	groups	group	NOUN
ap-1682	43	16	of	of	ADP
ap-1682	43	17	bars	bar	NOUN
ap-1682	43	18	)	)	PUNCT
ap-1682	43	19	,	,	PUNCT
ap-1682	43	20	then	then	ADV
ap-1682	43	21	nk	nk	PROPN
ap-1682	43	22	possible	possible	ADJ
ap-1682	43	23	solutions	solution	NOUN
ap-1682	43	24	exist	exist	VERB
ap-1682	43	25	,	,	PUNCT
ap-1682	43	26	i.e.	i.e.	X
ap-1682	43	27	,	,	PUNCT
ap-1682	43	28	the	the	DET
ap-1682	43	29	problem	problem	NOUN
ap-1682	43	30	grows	grow	VERB
ap-1682	43	31	exponentially	exponentially	ADV
ap-1682	43	32	with	with	ADP
ap-1682	43	33	the	the	DET
ap-1682	43	34	growing	grow	VERB
ap-1682	43	35	number	number	NOUN
ap-1682	43	36	of	of	ADP
ap-1682	43	37	variables	variable	NOUN
ap-1682	43	38	.	.	PUNCT
ap-1682	44	1	enumeration	enumeration	NOUN
ap-1682	44	2	can	can	AUX
ap-1682	44	3	therefore	therefore	ADV
ap-1682	44	4	be	be	AUX
ap-1682	44	5	applied	apply	VERB
ap-1682	44	6	only	only	ADV
ap-1682	44	7	for	for	ADP
ap-1682	44	8	small	small	ADJ
ap-1682	44	9	structures	structure	NOUN
ap-1682	44	10	or	or	CCONJ
ap-1682	44	11	for	for	ADP
ap-1682	44	12	analysing	analyse	VERB
ap-1682	44	13	the	the	DET
ap-1682	44	14	neighborhood	neighborhood	NOUN
ap-1682	44	15	of	of	ADP
ap-1682	44	16	some	some	DET
ap-1682	44	17	local	local	ADJ
ap-1682	44	18	optima	optima	NOUN
ap-1682	44	19	.	.	PROPN
ap-1682	45	1	3.2	3.2	NUM
ap-1682	45	2	a	a	DET
ap-1682	45	3	method	method	NOUN
ap-1682	45	4	based	base	VERB
ap-1682	45	5	on	on	ADP
ap-1682	45	6	branch	branch	NOUN
ap-1682	45	7	and	and	CCONJ
ap-1682	45	8	bound	bind	VERB
ap-1682	45	9	principles	principle	NOUN
ap-1682	45	10	a	a	DET
ap-1682	45	11	branch	branch	NOUN
ap-1682	45	12	and	and	CCONJ
ap-1682	45	13	bound	bind	VERB
ap-1682	45	14	method	method	NOUN
ap-1682	45	15	is	be	AUX
ap-1682	45	16	another	another	DET
ap-1682	45	17	method	method	NOUN
ap-1682	45	18	for	for	ADP
ap-1682	45	19	obtaining	obtain	VERB
ap-1682	45	20	global	global	ADJ
ap-1682	45	21	optima	optima	PROPN
ap-1682	45	22	.	.	PUNCT
ap-1682	46	1	land	land	NOUN
ap-1682	46	2	and	and	CCONJ
ap-1682	46	3	doig	doig	NOUN
ap-1682	47	1	[	[	X
ap-1682	47	2	4	4	NUM
ap-1682	47	3	]	]	PUNCT
ap-1682	47	4	invented	invent	VERB
ap-1682	47	5	this	this	DET
ap-1682	47	6	method	method	NOUN
ap-1682	47	7	for	for	ADP
ap-1682	47	8	linear	linear	NOUN
ap-1682	47	9	programming	programming	NOUN
ap-1682	47	10	problems	problem	NOUN
ap-1682	47	11	.	.	PUNCT
ap-1682	48	1	later	later	ADV
ap-1682	48	2	,	,	PUNCT
ap-1682	48	3	it	it	PRON
ap-1682	48	4	was	be	AUX
ap-1682	48	5	modified	modify	VERB
ap-1682	48	6	for	for	ADP
ap-1682	48	7	discrete	discrete	ADJ
ap-1682	48	8	problems	problem	NOUN
ap-1682	48	9	and	and	CCONJ
ap-1682	48	10	for	for	ADP
ap-1682	48	11	mixeddiscrete	mixeddiscrete	NOUN
ap-1682	48	12	problems	problem	NOUN
ap-1682	48	13	[	[	X
ap-1682	48	14	5	5	NUM
ap-1682	48	15	]	]	PUNCT
ap-1682	48	16	.	.	PUNCT
ap-1682	49	1	branch	branch	NOUN
ap-1682	49	2	and	and	CCONJ
ap-1682	49	3	bound	bound	ADJ
ap-1682	49	4	methods	method	NOUN
ap-1682	49	5	are	be	AUX
ap-1682	49	6	based	base	VERB
ap-1682	49	7	on	on	ADP
ap-1682	49	8	a	a	DET
ap-1682	49	9	dividing	dividing	NOUN
ap-1682	49	10	the	the	DET
ap-1682	49	11	main	main	ADJ
ap-1682	49	12	problem	problem	NOUN
ap-1682	49	13	into	into	ADP
ap-1682	49	14	several	several	ADJ
ap-1682	49	15	subproblems	subproblem	NOUN
ap-1682	49	16	,	,	PUNCT
ap-1682	49	17	known	know	VERB
ap-1682	49	18	as	as	ADP
ap-1682	49	19	branches	branch	NOUN
ap-1682	49	20	.	.	PUNCT
ap-1682	50	1	to	to	PART
ap-1682	50	2	estimate	estimate	VERB
ap-1682	50	3	which	which	DET
ap-1682	50	4	branches	branch	NOUN
ap-1682	50	5	are	be	AUX
ap-1682	50	6	to	to	PART
ap-1682	50	7	be	be	AUX
ap-1682	50	8	evaluated	evaluate	VERB
ap-1682	50	9	,	,	PUNCT
ap-1682	50	10	the	the	DET
ap-1682	50	11	existence	existence	NOUN
ap-1682	50	12	of	of	ADP
ap-1682	50	13	the	the	DET
ap-1682	50	14	lower	low	ADJ
ap-1682	50	15	and	and	CCONJ
ap-1682	50	16	upper	upper	ADJ
ap-1682	50	17	bounds	bound	NOUN
ap-1682	50	18	is	be	AUX
ap-1682	50	19	assumed	assume	VERB
ap-1682	50	20	to	to	PART
ap-1682	50	21	restrict	restrict	VERB
ap-1682	50	22	the	the	DET
ap-1682	50	23	searched	search	VERB
ap-1682	50	24	space	space	NOUN
ap-1682	50	25	.	.	PUNCT
ap-1682	51	1	the	the	DET
ap-1682	51	2	lower	lower	ADV
ap-1682	51	3	bound	bind	VERB
ap-1682	51	4	can	can	AUX
ap-1682	51	5	be	be	AUX
ap-1682	51	6	obtained	obtain	VERB
ap-1682	51	7	by	by	ADP
ap-1682	51	8	any	any	DET
ap-1682	51	9	continuous	continuous	ADJ
ap-1682	51	10	optimization	optimization	NOUN
ap-1682	51	11	method	method	NOUN
ap-1682	51	12	,	,	PUNCT
ap-1682	51	13	because	because	SCONJ
ap-1682	51	14	the	the	DET
ap-1682	51	15	global	global	ADJ
ap-1682	51	16	optimum	optimum	NOUN
ap-1682	51	17	with	with	ADP
ap-1682	51	18	discrete	discrete	ADJ
ap-1682	51	19	design	design	NOUN
ap-1682	51	20	variables	variable	NOUN
ap-1682	51	21	will	will	AUX
ap-1682	51	22	never	never	ADV
ap-1682	51	23	provide	provide	VERB
ap-1682	51	24	a	a	DET
ap-1682	51	25	lower	low	ADJ
ap-1682	51	26	value	value	NOUN
ap-1682	51	27	of	of	ADP
ap-1682	51	28	the	the	DET
ap-1682	51	29	objective	objective	ADJ
ap-1682	51	30	function	function	NOUN
ap-1682	51	31	than	than	ADP
ap-1682	51	32	the	the	DET
ap-1682	51	33	global	global	ADJ
ap-1682	51	34	optimum	optimum	NOUN
ap-1682	51	35	with	with	ADP
ap-1682	51	36	continuous	continuous	ADJ
ap-1682	51	37	design	design	NOUN
ap-1682	51	38	variables	variable	NOUN
ap-1682	51	39	.	.	PUNCT
ap-1682	52	1	the	the	DET
ap-1682	52	2	upper	upper	ADJ
ap-1682	52	3	bound	bind	VERB
ap-1682	52	4	can	can	AUX
ap-1682	52	5	be	be	AUX
ap-1682	52	6	obtained	obtain	VERB
ap-1682	52	7	by	by	ADP
ap-1682	52	8	any	any	DET
ap-1682	52	9	heuristic	heuristic	ADJ
ap-1682	52	10	method	method	NOUN
ap-1682	52	11	,	,	PUNCT
ap-1682	52	12	because	because	SCONJ
ap-1682	52	13	a	a	DET
ap-1682	52	14	local	local	ADJ
ap-1682	52	15	optimum	optimum	NOUN
ap-1682	52	16	always	always	ADV
ap-1682	52	17	has	have	VERB
ap-1682	52	18	a	a	DET
ap-1682	52	19	greater	great	ADJ
ap-1682	52	20	or	or	CCONJ
ap-1682	52	21	equal	equal	ADJ
ap-1682	52	22	value	value	NOUN
ap-1682	52	23	of	of	ADP
ap-1682	52	24	the	the	DET
ap-1682	52	25	objective	objective	ADJ
ap-1682	52	26	function	function	NOUN
ap-1682	52	27	than	than	ADP
ap-1682	52	28	the	the	DET
ap-1682	52	29	global	global	ADJ
ap-1682	52	30	optimum	optimum	NOUN
ap-1682	52	31	.	.	PUNCT
ap-1682	53	1	since	since	SCONJ
ap-1682	53	2	the	the	DET
ap-1682	53	3	constraints	constraint	NOUN
ap-1682	53	4	for	for	ADP
ap-1682	53	5	the	the	DET
ap-1682	53	6	sizing	sizing	NOUN
ap-1682	53	7	optimization	optimization	NOUN
ap-1682	53	8	problem	problem	NOUN
ap-1682	53	9	are	be	AUX
ap-1682	53	10	more	more	ADV
ap-1682	53	11	computationally	computationally	ADV
ap-1682	53	12	demanding	demanding	ADJ
ap-1682	53	13	than	than	ADP
ap-1682	53	14	the	the	DET
ap-1682	53	15	value	value	NOUN
ap-1682	53	16	of	of	ADP
ap-1682	53	17	the	the	DET
ap-1682	53	18	objective	objective	ADJ
ap-1682	53	19	function	function	NOUN
ap-1682	53	20	,	,	PUNCT
ap-1682	53	21	they	they	PRON
ap-1682	53	22	are	be	AUX
ap-1682	53	23	calculated	calculate	VERB
ap-1682	53	24	only	only	ADV
ap-1682	53	25	for	for	ADP
ap-1682	53	26	solutions	solution	NOUN
ap-1682	53	27	that	that	PRON
ap-1682	53	28	lie	lie	VERB
ap-1682	53	29	between	between	ADP
ap-1682	53	30	the	the	DET
ap-1682	53	31	lower	low	ADJ
ap-1682	53	32	and	and	CCONJ
ap-1682	53	33	upper	upper	ADJ
ap-1682	53	34	bounds	bound	NOUN
ap-1682	53	35	.	.	PUNCT
ap-1682	54	1	if	if	SCONJ
ap-1682	54	2	we	we	PRON
ap-1682	54	3	obtain	obtain	VERB
ap-1682	54	4	a	a	DET
ap-1682	54	5	subproblem	subproblem	NOUN
ap-1682	54	6	with	with	ADP
ap-1682	54	7	a	a	DET
ap-1682	54	8	value	value	NOUN
ap-1682	54	9	of	of	ADP
ap-1682	54	10	the	the	DET
ap-1682	54	11	objective	objective	ADJ
ap-1682	54	12	function	function	NOUN
ap-1682	54	13	outside	outside	ADP
ap-1682	54	14	the	the	DET
ap-1682	54	15	given	give	VERB
ap-1682	54	16	bounds	bound	NOUN
ap-1682	54	17	,	,	PUNCT
ap-1682	54	18	the	the	DET
ap-1682	54	19	rest	rest	NOUN
ap-1682	54	20	of	of	ADP
ap-1682	54	21	the	the	DET
ap-1682	54	22	branch	branch	NOUN
ap-1682	54	23	is	be	AUX
ap-1682	54	24	not	not	PART
ap-1682	54	25	calculated	calculate	VERB
ap-1682	54	26	because	because	SCONJ
ap-1682	54	27	a	a	DET
ap-1682	54	28	global	global	ADJ
ap-1682	54	29	optimum	optimum	NOUN
ap-1682	54	30	can	can	AUX
ap-1682	54	31	not	not	PART
ap-1682	54	32	be	be	AUX
ap-1682	54	33	located	locate	VERB
ap-1682	54	34	there	there	ADV
ap-1682	54	35	.	.	PUNCT
ap-1682	55	1	the	the	DET
ap-1682	55	2	more	more	ADV
ap-1682	55	3	accurate	accurate	ADJ
ap-1682	55	4	the	the	DET
ap-1682	55	5	estimates	estimate	NOUN
ap-1682	55	6	of	of	ADP
ap-1682	55	7	the	the	DET
ap-1682	55	8	lower	low	ADJ
ap-1682	55	9	and	and	CCONJ
ap-1682	55	10	upper	upper	ADJ
ap-1682	55	11	bounds	bound	NOUN
ap-1682	55	12	are	be	AUX
ap-1682	55	13	,	,	PUNCT
ap-1682	55	14	the	the	PRON
ap-1682	55	15	narrower	narrow	ADJ
ap-1682	55	16	the	the	DET
ap-1682	55	17	searched	search	VERB
ap-1682	55	18	space	space	NOUN
ap-1682	55	19	can	can	AUX
ap-1682	55	20	be	be	AUX
ap-1682	55	21	.	.	PUNCT
ap-1682	56	1	it	it	PRON
ap-1682	56	2	is	be	AUX
ap-1682	56	3	thus	thus	ADV
ap-1682	56	4	advantageous	advantageous	ADJ
ap-1682	56	5	to	to	PART
ap-1682	56	6	decrease	decrease	VERB
ap-1682	56	7	the	the	DET
ap-1682	56	8	upper	upper	ADJ
ap-1682	56	9	bound	bind	VERB
ap-1682	56	10	on	on	ADP
ap-1682	56	11	the	the	DET
ap-1682	56	12	basis	basis	NOUN
ap-1682	56	13	of	of	ADP
ap-1682	56	14	already	already	ADV
ap-1682	56	15	obtained	obtain	VERB
ap-1682	56	16	objective	objective	ADJ
ap-1682	56	17	function	function	NOUN
ap-1682	56	18	values	value	NOUN
ap-1682	56	19	.	.	PUNCT
ap-1682	57	1	although	although	SCONJ
ap-1682	57	2	this	this	DET
ap-1682	57	3	methodology	methodology	NOUN
ap-1682	57	4	is	be	AUX
ap-1682	57	5	more	more	ADV
ap-1682	57	6	efficient	efficient	ADJ
ap-1682	57	7	than	than	ADP
ap-1682	57	8	enumeration	enumeration	NOUN
ap-1682	57	9	,	,	PUNCT
ap-1682	57	10	it	it	PRON
ap-1682	57	11	is	be	AUX
ap-1682	57	12	still	still	ADV
ap-1682	57	13	time	time	NOUN
ap-1682	57	14	consuming	consume	VERB
ap-1682	57	15	.	.	PUNCT
ap-1682	58	1	however	however	ADV
ap-1682	58	2	,	,	PUNCT
ap-1682	58	3	it	it	PRON
ap-1682	58	4	is	be	AUX
ap-1682	58	5	possible	possible	ADJ
ap-1682	58	6	to	to	PART
ap-1682	58	7	parallelize	parallelize	VERB
ap-1682	58	8	the	the	DET
ap-1682	58	9	algorithm	algorithm	NOUN
ap-1682	58	10	to	to	PART
ap-1682	58	11	reduce	reduce	VERB
ap-1682	58	12	the	the	DET
ap-1682	58	13	computation	computation	NOUN
ap-1682	58	14	time	time	NOUN
ap-1682	58	15	.	.	PUNCT
ap-1682	59	1	the	the	DET
ap-1682	59	2	main	main	ADJ
ap-1682	59	3	idea	idea	NOUN
ap-1682	59	4	of	of	ADP
ap-1682	59	5	the	the	DET
ap-1682	59	6	parallel	parallel	ADJ
ap-1682	59	7	version	version	NOUN
ap-1682	59	8	of	of	ADP
ap-1682	59	9	the	the	DET
ap-1682	59	10	algorithm	algorithm	NOUN
ap-1682	59	11	is	be	AUX
ap-1682	59	12	presented	present	VERB
ap-1682	59	13	in	in	ADP
ap-1682	59	14	section	section	NOUN
ap-1682	59	15	6	6	NUM
ap-1682	59	16	.	.	NOUN
ap-1682	59	17	4	4	NUM
ap-1682	59	18	continuous	continuous	ADJ
ap-1682	59	19	problem	problem	NOUN
ap-1682	59	20	a	a	DET
ap-1682	59	21	continuous	continuous	ADJ
ap-1682	59	22	optimization	optimization	NOUN
ap-1682	59	23	problem	problem	NOUN
ap-1682	59	24	is	be	AUX
ap-1682	59	25	more	more	ADV
ap-1682	59	26	complex	complex	ADJ
ap-1682	59	27	than	than	ADP
ap-1682	59	28	a	a	DET
ap-1682	59	29	discrete	discrete	ADJ
ap-1682	59	30	problem	problem	NOUN
ap-1682	59	31	,	,	PUNCT
ap-1682	59	32	because	because	SCONJ
ap-1682	59	33	an	an	DET
ap-1682	59	34	infinite	infinite	ADJ
ap-1682	59	35	number	number	NOUN
ap-1682	59	36	of	of	ADP
ap-1682	59	37	potential	potential	ADJ
ap-1682	59	38	solutions	solution	NOUN
ap-1682	59	39	exist	exist	VERB
ap-1682	59	40	in	in	ADP
ap-1682	59	41	the	the	DET
ap-1682	59	42	space	space	NOUN
ap-1682	59	43	with	with	ADP
ap-1682	59	44	real	real	ADJ
ap-1682	59	45	numbers	number	NOUN
ap-1682	59	46	.	.	PUNCT
ap-1682	60	1	therefore	therefore	ADV
ap-1682	60	2	,	,	PUNCT
ap-1682	60	3	for	for	ADP
ap-1682	60	4	non	non	ADJ
ap-1682	60	5	-	-	ADJ
ap-1682	60	6	convex	convex	ADJ
ap-1682	60	7	problems	problem	NOUN
ap-1682	60	8	,	,	PUNCT
ap-1682	60	9	it	it	PRON
ap-1682	60	10	can	can	AUX
ap-1682	60	11	not	not	PART
ap-1682	60	12	be	be	AUX
ap-1682	60	13	guaranteed	guarantee	VERB
ap-1682	60	14	that	that	SCONJ
ap-1682	60	15	the	the	DET
ap-1682	60	16	optimum	optimum	NOUN
ap-1682	60	17	that	that	PRON
ap-1682	60	18	is	be	AUX
ap-1682	60	19	found	find	VERB
ap-1682	60	20	is	be	AUX
ap-1682	60	21	the	the	DET
ap-1682	60	22	global	global	ADJ
ap-1682	60	23	optimum	optimum	NOUN
ap-1682	60	24	.	.	PUNCT
ap-1682	61	1	however	however	ADV
ap-1682	61	2	,	,	PUNCT
ap-1682	61	3	powerful	powerful	ADJ
ap-1682	61	4	and	and	CCONJ
ap-1682	61	5	wellestablished	wellestablished	ADJ
ap-1682	61	6	continuous	continuous	ADJ
ap-1682	61	7	optimization	optimization	NOUN
ap-1682	61	8	algorithms	algorithm	NOUN
ap-1682	61	9	such	such	ADJ
ap-1682	61	10	as	as	ADP
ap-1682	61	11	mathematical	mathematical	ADJ
ap-1682	61	12	programming	programming	NOUN
ap-1682	61	13	methods	method	NOUN
ap-1682	61	14	,	,	PUNCT
ap-1682	61	15	can	can	AUX
ap-1682	61	16	be	be	AUX
ap-1682	61	17	used	use	VERB
ap-1682	61	18	for	for	ADP
ap-1682	61	19	obtaining	obtain	VERB
ap-1682	61	20	a	a	DET
ap-1682	61	21	potential	potential	ADJ
ap-1682	61	22	global	global	ADJ
ap-1682	61	23	optimum	optimum	NOUN
ap-1682	61	24	.	.	PUNCT
ap-1682	62	1	obtaining	obtain	VERB
ap-1682	62	2	a	a	DET
ap-1682	62	3	potential	potential	ADJ
ap-1682	62	4	global	global	ADJ
ap-1682	62	5	optimum	optimum	NOUN
ap-1682	62	6	with	with	ADP
ap-1682	62	7	continuous	continuous	ADJ
ap-1682	62	8	variables	variable	NOUN
ap-1682	62	9	is	be	AUX
ap-1682	62	10	therefore	therefore	ADV
ap-1682	62	11	less	less	ADV
ap-1682	62	12	demanding	demanding	ADJ
ap-1682	62	13	than	than	ADP
ap-1682	62	14	solving	solve	VERB
ap-1682	62	15	the	the	DET
ap-1682	62	16	optimization	optimization	NOUN
ap-1682	62	17	problem	problem	NOUN
ap-1682	62	18	with	with	ADP
ap-1682	62	19	discrete	discrete	ADJ
ap-1682	62	20	variables	variable	NOUN
ap-1682	62	21	.	.	PUNCT
ap-1682	63	1	the	the	DET
ap-1682	63	2	main	main	ADJ
ap-1682	63	3	disadvantage	disadvantage	NOUN
ap-1682	63	4	of	of	ADP
ap-1682	63	5	this	this	DET
ap-1682	63	6	methodology	methodology	NOUN
ap-1682	63	7	is	be	AUX
ap-1682	63	8	the	the	DET
ap-1682	63	9	uncertainty	uncertainty	NOUN
ap-1682	63	10	of	of	ADP
ap-1682	63	11	the	the	DET
ap-1682	63	12	quality	quality	NOUN
ap-1682	63	13	of	of	ADP
ap-1682	63	14	the	the	DET
ap-1682	63	15	solution	solution	NOUN
ap-1682	63	16	.	.	PUNCT
ap-1682	64	1	this	this	PRON
ap-1682	64	2	can	can	AUX
ap-1682	64	3	be	be	AUX
ap-1682	64	4	overcome	overcome	VERB
ap-1682	64	5	in	in	ADP
ap-1682	64	6	one	one	NUM
ap-1682	64	7	of	of	ADP
ap-1682	64	8	two	two	NUM
ap-1682	64	9	ways	way	NOUN
ap-1682	64	10	:	:	PUNCT
ap-1682	64	11	•	•	ADP
ap-1682	64	12	the	the	DET
ap-1682	64	13	branch	branch	NOUN
ap-1682	64	14	and	and	CCONJ
ap-1682	64	15	bound	bind	VERB
ap-1682	64	16	method	method	NOUN
ap-1682	64	17	expects	expect	VERB
ap-1682	64	18	that	that	SCONJ
ap-1682	64	19	the	the	DET
ap-1682	64	20	lower	low	ADJ
ap-1682	64	21	bound	bind	VERB
ap-1682	64	22	has	have	VERB
ap-1682	64	23	the	the	DET
ap-1682	64	24	same	same	ADJ
ap-1682	64	25	(	(	PUNCT
ap-1682	64	26	or	or	CCONJ
ap-1682	64	27	a	a	DET
ap-1682	64	28	lower	low	ADJ
ap-1682	64	29	)	)	PUNCT
ap-1682	64	30	value	value	NOUN
ap-1682	64	31	of	of	ADP
ap-1682	64	32	the	the	DET
ap-1682	64	33	objective	objective	ADJ
ap-1682	64	34	function	function	NOUN
ap-1682	64	35	as	as	ADP
ap-1682	64	36	the	the	DET
ap-1682	64	37	global	global	ADJ
ap-1682	64	38	optimum	optimum	NOUN
ap-1682	64	39	with	with	ADP
ap-1682	64	40	continuous	continuous	ADJ
ap-1682	64	41	variables	variable	NOUN
ap-1682	64	42	.	.	PUNCT
ap-1682	65	1	since	since	SCONJ
ap-1682	65	2	the	the	DET
ap-1682	65	3	global	global	ADJ
ap-1682	65	4	optimum	optimum	NOUN
ap-1682	65	5	of	of	ADP
ap-1682	65	6	the	the	DET
ap-1682	65	7	continuous	continuous	ADJ
ap-1682	65	8	problem	problem	NOUN
ap-1682	65	9	can	can	AUX
ap-1682	65	10	not	not	PART
ap-1682	65	11	be	be	AUX
ap-1682	65	12	generally	generally	ADV
ap-1682	65	13	known	know	VERB
ap-1682	65	14	,	,	PUNCT
ap-1682	65	15	the	the	DET
ap-1682	65	16	true	true	ADJ
ap-1682	65	17	lower	low	ADJ
ap-1682	65	18	bound	bind	VERB
ap-1682	65	19	can	can	AUX
ap-1682	65	20	not	not	PART
ap-1682	65	21	be	be	AUX
ap-1682	65	22	ensured	ensure	VERB
ap-1682	65	23	.	.	PUNCT
ap-1682	66	1	as	as	ADP
ap-1682	66	2	a	a	DET
ap-1682	66	3	solution	solution	NOUN
ap-1682	66	4	,	,	PUNCT
ap-1682	66	5	the	the	DET
ap-1682	66	6	lower	lower	ADV
ap-1682	66	7	bound	bind	VERB
ap-1682	66	8	is	be	AUX
ap-1682	66	9	set	set	VERB
ap-1682	66	10	to	to	ADP
ap-1682	66	11	its	its	PRON
ap-1682	66	12	lowest	low	ADJ
ap-1682	66	13	potential	potential	ADJ
ap-1682	66	14	minimum	minimum	NOUN
ap-1682	66	15	,	,	PUNCT
ap-1682	66	16	i.e.	i.e.	X
ap-1682	66	17	,	,	PUNCT
ap-1682	66	18	without	without	ADP
ap-1682	66	19	using	use	VERB
ap-1682	66	20	any	any	DET
ap-1682	66	21	continuous	continuous	ADJ
ap-1682	66	22	optimization	optimization	NOUN
ap-1682	66	23	method	method	NOUN
ap-1682	66	24	.	.	PUNCT
ap-1682	67	1	this	this	DET
ap-1682	67	2	process	process	NOUN
ap-1682	67	3	provides	provide	VERB
ap-1682	67	4	a	a	DET
ap-1682	67	5	real	real	ADJ
ap-1682	67	6	global	global	ADJ
ap-1682	67	7	optimum	optimum	NOUN
ap-1682	67	8	with	with	ADP
ap-1682	67	9	discrete	discrete	ADJ
ap-1682	67	10	variables	variable	NOUN
ap-1682	67	11	.	.	PUNCT
ap-1682	68	1	in	in	ADP
ap-1682	68	2	most	most	ADJ
ap-1682	68	3	cases	case	NOUN
ap-1682	68	4	,	,	PUNCT
ap-1682	68	5	however	however	ADV
ap-1682	68	6	,	,	PUNCT
ap-1682	68	7	the	the	DET
ap-1682	68	8	searched	search	VERB
ap-1682	68	9	space	space	NOUN
ap-1682	68	10	will	will	AUX
ap-1682	68	11	be	be	AUX
ap-1682	68	12	enormous	enormous	ADJ
ap-1682	68	13	for	for	ADP
ap-1682	68	14	the	the	DET
ap-1682	68	15	computation	computation	NOUN
ap-1682	68	16	of	of	ADP
ap-1682	68	17	all	all	DET
ap-1682	68	18	possible	possible	ADJ
ap-1682	68	19	solutions	solution	NOUN
ap-1682	68	20	in	in	ADP
ap-1682	68	21	real	real	ADJ
ap-1682	68	22	time	time	NOUN
ap-1682	68	23	.	.	PUNCT
ap-1682	69	1	•	•	NOUN
ap-1682	69	2	other	other	ADJ
ap-1682	69	3	approaches	approach	NOUN
ap-1682	69	4	do	do	AUX
ap-1682	69	5	not	not	PART
ap-1682	69	6	fully	fully	ADV
ap-1682	69	7	guarantee	guarantee	VERB
ap-1682	69	8	the	the	DET
ap-1682	69	9	acquisition	acquisition	NOUN
ap-1682	69	10	of	of	ADP
ap-1682	69	11	the	the	DET
ap-1682	69	12	global	global	ADJ
ap-1682	69	13	optimum	optimum	NOUN
ap-1682	69	14	.	.	PUNCT
ap-1682	70	1	nevertheless	nevertheless	ADV
ap-1682	70	2	,	,	PUNCT
ap-1682	70	3	the	the	DET
ap-1682	70	4	probability	probability	NOUN
ap-1682	70	5	of	of	ADP
ap-1682	70	6	obtaining	obtain	VERB
ap-1682	70	7	the	the	DET
ap-1682	70	8	global	global	ADJ
ap-1682	70	9	optimum	optimum	NOUN
ap-1682	70	10	is	be	AUX
ap-1682	70	11	acceptable	acceptable	ADJ
ap-1682	70	12	.	.	PUNCT
ap-1682	71	1	these	these	DET
ap-1682	71	2	approaches	approach	NOUN
ap-1682	71	3	are	be	AUX
ap-1682	71	4	based	base	VERB
ap-1682	71	5	on	on	ADP
ap-1682	71	6	estimating	estimate	VERB
ap-1682	71	7	the	the	DET
ap-1682	71	8	global	global	ADJ
ap-1682	71	9	optimum	optimum	NOUN
ap-1682	71	10	with	with	ADP
ap-1682	71	11	continuous	continuous	ADJ
ap-1682	71	12	variables	variable	NOUN
ap-1682	71	13	and	and	CCONJ
ap-1682	71	14	the	the	DET
ap-1682	71	15	value	value	NOUN
ap-1682	71	16	of	of	ADP
ap-1682	71	17	its	its	PRON
ap-1682	71	18	objective	objective	ADJ
ap-1682	71	19	function	function	NOUN
ap-1682	71	20	.	.	PUNCT
ap-1682	72	1	we	we	PRON
ap-1682	72	2	use	use	VERB
ap-1682	72	3	nonlinear	nonlinear	ADJ
ap-1682	72	4	programming	programming	NOUN
ap-1682	72	5	that	that	PRON
ap-1682	72	6	is	be	AUX
ap-1682	72	7	implemented	implement	VERB
ap-1682	72	8	in	in	ADP
ap-1682	72	9	the	the	DET
ap-1682	72	10	matlab	matlab	PROPN
ap-1682	72	11	environment	environment	NOUN
ap-1682	72	12	(	(	PUNCT
ap-1682	72	13	e.g.	e.g.	ADV
ap-1682	72	14	the	the	DET
ap-1682	72	15	fmincon	fmincon	NOUN
ap-1682	72	16	function	function	NOUN
ap-1682	72	17	)	)	PUNCT
ap-1682	72	18	.	.	PUNCT
ap-1682	73	1	this	this	DET
ap-1682	73	2	routine	routine	NOUN
ap-1682	73	3	is	be	AUX
ap-1682	73	4	executed	execute	VERB
ap-1682	73	5	several	several	ADJ
ap-1682	73	6	times	time	NOUN
ap-1682	73	7	from	from	ADP
ap-1682	73	8	random	random	ADJ
ap-1682	73	9	initial	initial	ADJ
ap-1682	73	10	points	point	NOUN
ap-1682	73	11	.	.	PUNCT
ap-1682	74	1	if	if	SCONJ
ap-1682	74	2	the	the	DET
ap-1682	74	3	obtained	obtain	VERB
ap-1682	74	4	optima	optima	PROPN
ap-1682	74	5	do	do	AUX
ap-1682	74	6	not	not	PART
ap-1682	74	7	differ	differ	VERB
ap-1682	74	8	from	from	ADP
ap-1682	74	9	each	each	DET
ap-1682	74	10	other	other	ADJ
ap-1682	74	11	and	and	CCONJ
ap-1682	74	12	the	the	DET
ap-1682	74	13	results	result	NOUN
ap-1682	74	14	are	be	AUX
ap-1682	74	15	comparable	comparable	ADJ
ap-1682	74	16	to	to	ADP
ap-1682	74	17	optima	optima	PROPN
ap-1682	74	18	published	publish	VERB
ap-1682	74	19	in	in	ADP
ap-1682	74	20	the	the	DET
ap-1682	74	21	available	available	ADJ
ap-1682	74	22	literature	literature	NOUN
ap-1682	74	23	,	,	PUNCT
ap-1682	74	24	the	the	DET
ap-1682	74	25	estimate	estimate	NOUN
ap-1682	74	26	is	be	AUX
ap-1682	74	27	considered	consider	VERB
ap-1682	74	28	as	as	ADP
ap-1682	74	29	credible	credible	ADJ
ap-1682	74	30	.	.	PUNCT
ap-1682	75	1	if	if	SCONJ
ap-1682	75	2	the	the	DET
ap-1682	75	3	obtained	obtain	VERB
ap-1682	75	4	optima	optima	PROPN
ap-1682	75	5	differ	differ	VERB
ap-1682	75	6	from	from	ADP
ap-1682	75	7	each	each	DET
ap-1682	75	8	other	other	ADJ
ap-1682	75	9	,	,	PUNCT
ap-1682	75	10	then	then	ADV
ap-1682	75	11	it	it	PRON
ap-1682	75	12	is	be	AUX
ap-1682	75	13	not	not	PART
ap-1682	75	14	possible	possible	ADJ
ap-1682	75	15	to	to	PART
ap-1682	75	16	use	use	VERB
ap-1682	75	17	them	they	PRON
ap-1682	75	18	as	as	ADP
ap-1682	75	19	the	the	DET
ap-1682	75	20	lower	lower	ADV
ap-1682	75	21	bound	bind	VERB
ap-1682	75	22	.	.	PUNCT
ap-1682	76	1	the	the	DET
ap-1682	76	2	first	first	ADJ
ap-1682	76	3	approach	approach	NOUN
ap-1682	76	4	(	(	PUNCT
ap-1682	76	5	without	without	ADP
ap-1682	76	6	using	use	VERB
ap-1682	76	7	the	the	DET
ap-1682	76	8	continuous	continuous	ADJ
ap-1682	76	9	optimization	optimization	NOUN
ap-1682	76	10	method	method	NOUN
ap-1682	76	11	)	)	PUNCT
ap-1682	76	12	is	be	AUX
ap-1682	76	13	then	then	ADV
ap-1682	76	14	used	use	VERB
ap-1682	76	15	,	,	PUNCT
ap-1682	76	16	or	or	CCONJ
ap-1682	76	17	the	the	DET
ap-1682	76	18	lower	lower	ADV
ap-1682	76	19	bound	bind	VERB
ap-1682	76	20	is	be	AUX
ap-1682	76	21	estimated	estimate	VERB
ap-1682	76	22	to	to	PART
ap-1682	76	23	be	be	AUX
ap-1682	76	24	e.g.	e.g.	ADV
ap-1682	76	25	20	20	NUM
ap-1682	76	26	%	%	NOUN
ap-1682	76	27	lower	low	ADJ
ap-1682	76	28	than	than	ADP
ap-1682	76	29	the	the	DET
ap-1682	76	30	solution	solution	NOUN
ap-1682	76	31	what	what	PRON
ap-1682	76	32	is	be	AUX
ap-1682	76	33	obtained	obtain	VERB
ap-1682	76	34	.	.	PUNCT
ap-1682	77	1	75	75	NUM
ap-1682	77	2	acta	acta	PROPN
ap-1682	77	3	polytechnica	polytechnica	PROPN
ap-1682	77	4	vol	vol	NOUN
ap-1682	77	5	.	.	PROPN
ap-1682	78	1	52	52	NUM
ap-1682	78	2	no	no	NOUN
ap-1682	78	3	.	.	PUNCT
ap-1682	79	1	6/2012	6/2012	NUM
ap-1682	79	2	10	10	NUM
ap-1682	79	3	in	in	ADP
ap-1682	79	4	3	3	NUM
ap-1682	79	5	kips	kip	NOUN
ap-1682	79	6	5	5	NUM
ap-1682	79	7	kips	kip	NOUN
ap-1682	79	8	1	1	NUM
ap-1682	79	9	kip	kip	PROPN
ap-1682	79	10	10	10	NUM
ap-1682	79	11	in	in	ADP
ap-1682	79	12	1	1	NUM
ap-1682	79	13	4	4	NUM
ap-1682	79	14	5	5	NUM
ap-1682	79	15	2	2	NUM
ap-1682	79	16	3	3	NUM
ap-1682	79	17	1	1	NUM
ap-1682	79	18	2	2	NUM
ap-1682	79	19	4	4	NUM
ap-1682	79	20	3	3	NUM
ap-1682	79	21	x	x	SYM
ap-1682	79	22	y	y	PRON
ap-1682	79	23	figure	figure	NOUN
ap-1682	79	24	1	1	NUM
ap-1682	79	25	:	:	PUNCT
ap-1682	79	26	the	the	DET
ap-1682	79	27	5	5	NUM
ap-1682	79	28	-	-	PUNCT
ap-1682	79	29	bar	bar	NOUN
ap-1682	79	30	truss	truss	NOUN
ap-1682	79	31	.	.	PUNCT
ap-1682	80	1	all	all	DET
ap-1682	80	2	continuous	continuous	ADJ
ap-1682	80	3	optima	optima	NOUN
ap-1682	80	4	for	for	ADP
ap-1682	80	5	problems	problem	NOUN
ap-1682	80	6	mentioned	mention	VERB
ap-1682	80	7	below	below	ADV
ap-1682	80	8	were	be	AUX
ap-1682	80	9	consistent	consistent	ADJ
ap-1682	80	10	with	with	ADP
ap-1682	80	11	published	publish	VERB
ap-1682	80	12	results	result	NOUN
ap-1682	80	13	.	.	PUNCT
ap-1682	81	1	for	for	ADP
ap-1682	81	2	the	the	DET
ap-1682	81	3	sake	sake	NOUN
ap-1682	81	4	of	of	ADP
ap-1682	81	5	certainty	certainty	NOUN
ap-1682	81	6	,	,	PUNCT
ap-1682	81	7	the	the	DET
ap-1682	81	8	nonlinear	nonlinear	ADJ
ap-1682	81	9	programming	programming	NOUN
ap-1682	81	10	method	method	NOUN
ap-1682	81	11	was	be	AUX
ap-1682	81	12	launched	launch	VERB
ap-1682	81	13	hundred	hundred	NUM
ap-1682	81	14	times	time	NOUN
ap-1682	81	15	with	with	ADP
ap-1682	81	16	different	different	ADJ
ap-1682	81	17	starting	starting	NOUN
ap-1682	81	18	vectors	vector	NOUN
ap-1682	81	19	,	,	PUNCT
ap-1682	81	20	and	and	CCONJ
ap-1682	81	21	the	the	DET
ap-1682	81	22	best	good	ADJ
ap-1682	81	23	solution	solution	NOUN
ap-1682	81	24	was	be	AUX
ap-1682	81	25	considered	consider	VERB
ap-1682	81	26	as	as	ADP
ap-1682	81	27	the	the	DET
ap-1682	81	28	lower	low	ADJ
ap-1682	81	29	bound	bind	VERB
ap-1682	81	30	.	.	PUNCT
ap-1682	82	1	5	5	NUM
ap-1682	82	2	benchmarks	benchmark	NOUN
ap-1682	82	3	5.1	5.1	NUM
ap-1682	82	4	5	5	NUM
ap-1682	82	5	-	-	PUNCT
ap-1682	82	6	bar	bar	NOUN
ap-1682	82	7	truss	truss	NOUN
ap-1682	82	8	it	it	PRON
ap-1682	82	9	was	be	AUX
ap-1682	82	10	necessary	necessary	ADJ
ap-1682	82	11	to	to	PART
ap-1682	82	12	have	have	VERB
ap-1682	82	13	a	a	DET
ap-1682	82	14	representative	representative	ADJ
ap-1682	82	15	example	example	NOUN
ap-1682	82	16	of	of	ADP
ap-1682	82	17	a	a	DET
ap-1682	82	18	structure	structure	NOUN
ap-1682	82	19	that	that	PRON
ap-1682	82	20	was	be	AUX
ap-1682	82	21	small	small	ADJ
ap-1682	82	22	enough	enough	ADV
ap-1682	82	23	for	for	ADP
ap-1682	82	24	computational	computational	ADJ
ap-1682	82	25	demands	demand	NOUN
ap-1682	82	26	and	and	CCONJ
ap-1682	82	27	yet	yet	ADV
ap-1682	82	28	big	big	ADJ
ap-1682	82	29	enough	enough	ADV
ap-1682	82	30	for	for	ADP
ap-1682	82	31	branching	branch	VERB
ap-1682	82	32	purposes	purpose	NOUN
ap-1682	82	33	in	in	ADP
ap-1682	82	34	order	order	NOUN
ap-1682	82	35	to	to	PART
ap-1682	82	36	test	test	VERB
ap-1682	82	37	the	the	DET
ap-1682	82	38	branch	branch	NOUN
ap-1682	82	39	and	and	CCONJ
ap-1682	82	40	bound	bind	VERB
ap-1682	82	41	algorithm	algorithm	NOUN
ap-1682	82	42	.	.	PUNCT
ap-1682	83	1	note	note	VERB
ap-1682	83	2	that	that	SCONJ
ap-1682	83	3	imperial	imperial	ADJ
ap-1682	83	4	units	unit	NOUN
ap-1682	83	5	are	be	AUX
ap-1682	83	6	used	use	VERB
ap-1682	83	7	throughout	throughout	ADP
ap-1682	83	8	the	the	DET
ap-1682	83	9	text	text	NOUN
ap-1682	83	10	,	,	PUNCT
ap-1682	83	11	because	because	SCONJ
ap-1682	83	12	our	our	PRON
ap-1682	83	13	solutions	solution	NOUN
ap-1682	83	14	will	will	AUX
ap-1682	83	15	be	be	AUX
ap-1682	83	16	compared	compare	VERB
ap-1682	83	17	with	with	ADP
ap-1682	83	18	published	publish	VERB
ap-1682	83	19	optima	optima	NOUN
ap-1682	83	20	in	in	ADP
ap-1682	83	21	the	the	DET
ap-1682	83	22	available	available	ADJ
ap-1682	83	23	literature	literature	NOUN
ap-1682	83	24	with	with	ADP
ap-1682	83	25	the	the	DET
ap-1682	83	26	same	same	ADJ
ap-1682	83	27	units	unit	NOUN
ap-1682	83	28	.	.	PUNCT
ap-1682	84	1	the	the	DET
ap-1682	84	2	structure	structure	NOUN
ap-1682	84	3	in	in	ADP
ap-1682	84	4	fig	fig	NOUN
ap-1682	84	5	.	.	PUNCT
ap-1682	85	1	1	1	NUM
ap-1682	85	2	has	have	VERB
ap-1682	85	3	four	four	NUM
ap-1682	85	4	nodes	node	NOUN
ap-1682	85	5	and	and	CCONJ
ap-1682	85	6	five	five	NUM
ap-1682	85	7	truss	truss	ADJ
ap-1682	85	8	bars	bar	NOUN
ap-1682	85	9	,	,	PUNCT
ap-1682	85	10	and	and	CCONJ
ap-1682	85	11	is	be	AUX
ap-1682	85	12	made	make	VERB
ap-1682	85	13	from	from	ADP
ap-1682	85	14	aluminium	aluminium	NOUN
ap-1682	85	15	.	.	PUNCT
ap-1682	86	1	the	the	DET
ap-1682	86	2	density	density	NOUN
ap-1682	86	3	of	of	ADP
ap-1682	86	4	the	the	DET
ap-1682	86	5	material	material	NOUN
ap-1682	86	6	is	be	AUX
ap-1682	86	7	0.1	0.1	NUM
ap-1682	86	8	lb	lb	NUM
ap-1682	86	9	/	/	SYM
ap-1682	86	10	in3	in3	PROPN
ap-1682	86	11	and	and	CCONJ
ap-1682	86	12	the	the	DET
ap-1682	86	13	young	young	ADJ
ap-1682	86	14	’s	’s	PART
ap-1682	86	15	modulus	modulus	NOUN
ap-1682	86	16	is	be	AUX
ap-1682	86	17	equal	equal	ADJ
ap-1682	86	18	to	to	ADP
ap-1682	86	19	104	104	NUM
ap-1682	86	20	ksi	ksi	NOUN
ap-1682	86	21	.	.	PUNCT
ap-1682	87	1	the	the	DET
ap-1682	87	2	allowable	allowable	ADJ
ap-1682	87	3	stress	stress	NOUN
ap-1682	87	4	is	be	AUX
ap-1682	87	5	limited	limit	VERB
ap-1682	87	6	to	to	PART
ap-1682	87	7	±60	±60	VERB
ap-1682	87	8	ksi	ksi	NOUN
ap-1682	87	9	in	in	ADP
ap-1682	87	10	each	each	DET
ap-1682	87	11	element	element	NOUN
ap-1682	87	12	,	,	PUNCT
ap-1682	87	13	and	and	CCONJ
ap-1682	87	14	the	the	DET
ap-1682	87	15	displacements	displacement	NOUN
ap-1682	87	16	are	be	AUX
ap-1682	87	17	limited	limit	VERB
ap-1682	87	18	to	to	ADP
ap-1682	87	19	±0.06	±0.06	PROPN
ap-1682	87	20	in	in	ADV
ap-1682	87	21	along	along	ADP
ap-1682	87	22	the	the	DET
ap-1682	87	23	horizontal	horizontal	ADJ
ap-1682	87	24	and	and	CCONJ
ap-1682	87	25	vertical	vertical	ADJ
ap-1682	87	26	directions	direction	NOUN
ap-1682	87	27	.	.	PUNCT
ap-1682	88	1	the	the	DET
ap-1682	88	2	continuous	continuous	ADJ
ap-1682	88	3	variables	variable	NOUN
ap-1682	88	4	can	can	AUX
ap-1682	88	5	vary	vary	VERB
ap-1682	88	6	between	between	ADP
ap-1682	88	7	the	the	DET
ap-1682	88	8	lower	lower	ADV
ap-1682	88	9	bound	bound	ADJ
ap-1682	88	10	0.01	0.01	NUM
ap-1682	88	11	in2	in2	PROPN
ap-1682	88	12	and	and	CCONJ
ap-1682	88	13	the	the	DET
ap-1682	88	14	upper	upper	ADJ
ap-1682	88	15	bound	bind	VERB
ap-1682	88	16	0.1	0.1	NUM
ap-1682	88	17	in2	in2	PROPN
ap-1682	88	18	.	.	PUNCT
ap-1682	89	1	a	a	DET
ap-1682	89	2	function	function	NOUN
ap-1682	89	3	for	for	ADP
ap-1682	89	4	nonlinear	nonlinear	ADJ
ap-1682	89	5	programming	programming	NOUN
ap-1682	89	6	fmincon	fmincon	NOUN
ap-1682	89	7	[	[	X
ap-1682	89	8	6	6	NUM
ap-1682	89	9	]	]	PUNCT
ap-1682	89	10	offers	offer	VERB
ap-1682	89	11	four	four	NUM
ap-1682	89	12	variants	variant	NOUN
ap-1682	89	13	of	of	ADP
ap-1682	89	14	the	the	DET
ap-1682	89	15	optimization	optimization	NOUN
ap-1682	89	16	algorithms	algorithm	NOUN
ap-1682	89	17	.	.	PUNCT
ap-1682	90	1	in	in	ADP
ap-1682	90	2	this	this	DET
ap-1682	90	3	paper	paper	NOUN
ap-1682	90	4	,	,	PUNCT
ap-1682	90	5	the	the	DET
ap-1682	90	6	active	active	ADJ
ap-1682	90	7	set	set	NOUN
ap-1682	90	8	method	method	NOUN
ap-1682	90	9	[	[	X
ap-1682	90	10	7	7	NUM
ap-1682	90	11	]	]	PUNCT
ap-1682	90	12	is	be	AUX
ap-1682	90	13	suitable	suitable	ADJ
ap-1682	90	14	for	for	ADP
ap-1682	90	15	our	our	PRON
ap-1682	90	16	continuous	continuous	ADJ
ap-1682	90	17	sizing	sizing	NOUN
ap-1682	90	18	optimization	optimization	NOUN
ap-1682	90	19	problem	problem	NOUN
ap-1682	90	20	.	.	PUNCT
ap-1682	91	1	it	it	PRON
ap-1682	91	2	is	be	AUX
ap-1682	91	3	based	base	VERB
ap-1682	91	4	on	on	ADP
ap-1682	91	5	changing	change	VERB
ap-1682	91	6	inequalities	inequality	NOUN
ap-1682	91	7	into	into	ADP
ap-1682	91	8	equalities	equality	NOUN
ap-1682	91	9	,	,	PUNCT
ap-1682	91	10	followed	follow	VERB
ap-1682	91	11	by	by	ADP
ap-1682	91	12	the	the	DET
ap-1682	91	13	line	line	NOUN
ap-1682	91	14	-	-	PUNCT
ap-1682	91	15	search	search	NOUN
ap-1682	91	16	algorithm	algorithm	NOUN
ap-1682	91	17	leading	lead	VERB
ap-1682	91	18	to	to	ADP
ap-1682	91	19	a	a	DET
ap-1682	91	20	quadratic	quadratic	ADJ
ap-1682	91	21	subproblem	subproblem	NOUN
ap-1682	91	22	.	.	PUNCT
ap-1682	92	1	this	this	DET
ap-1682	92	2	procedure	procedure	NOUN
ap-1682	92	3	is	be	AUX
ap-1682	92	4	repeated	repeat	VERB
ap-1682	92	5	in	in	ADP
ap-1682	92	6	a	a	DET
ap-1682	92	7	sequence	sequence	NOUN
ap-1682	92	8	which	which	PRON
ap-1682	92	9	converges	converge	VERB
ap-1682	92	10	in	in	ADP
ap-1682	92	11	the	the	DET
ap-1682	92	12	limit	limit	NOUN
ap-1682	92	13	to	to	ADP
ap-1682	92	14	a	a	DET
ap-1682	92	15	critical	critical	ADJ
ap-1682	92	16	point	point	NOUN
ap-1682	92	17	[	[	X
ap-1682	92	18	8	8	NUM
ap-1682	92	19	]	]	PUNCT
ap-1682	92	20	.	.	PUNCT
ap-1682	93	1	a	a	DET
ap-1682	93	2	starting	starting	NOUN
ap-1682	93	3	point	point	NOUN
ap-1682	93	4	,	,	PUNCT
ap-1682	93	5	i.e.	i.e.	X
ap-1682	93	6	,	,	PUNCT
ap-1682	93	7	a	a	DET
ap-1682	93	8	design	design	NOUN
ap-1682	93	9	variable	variable	ADJ
ap-1682	93	10	vector	vector	NOUN
ap-1682	93	11	composed	compose	VERB
ap-1682	93	12	of	of	ADP
ap-1682	93	13	cross	cross	ADJ
ap-1682	93	14	-	-	ADJ
ap-1682	93	15	sectional	sectional	ADJ
ap-1682	93	16	areas	area	NOUN
ap-1682	93	17	,	,	PUNCT
ap-1682	93	18	an	an	DET
ap-1682	93	19	objective	objective	ADJ
ap-1682	93	20	function	function	NOUN
ap-1682	93	21	,	,	PUNCT
ap-1682	93	22	constraints	constraint	NOUN
ap-1682	93	23	and	and	CCONJ
ap-1682	93	24	lower	low	ADJ
ap-1682	93	25	and	and	CCONJ
ap-1682	93	26	upper	upper	ADJ
ap-1682	93	27	bounds	bound	NOUN
ap-1682	93	28	of	of	ADP
ap-1682	93	29	the	the	DET
ap-1682	93	30	variables	variable	NOUN
ap-1682	93	31	are	be	AUX
ap-1682	93	32	necessary	necessary	ADJ
ap-1682	93	33	as	as	ADP
ap-1682	93	34	an	an	DET
ap-1682	93	35	input	input	NOUN
ap-1682	93	36	at	at	ADP
ap-1682	93	37	the	the	DET
ap-1682	93	38	beginning	beginning	NOUN
ap-1682	93	39	of	of	ADP
ap-1682	93	40	the	the	DET
ap-1682	93	41	algorithm	algorithm	NOUN
ap-1682	93	42	.	.	PUNCT
ap-1682	94	1	the	the	DET
ap-1682	94	2	objective	objective	ADJ
ap-1682	94	3	function	function	NOUN
ap-1682	94	4	is	be	AUX
ap-1682	94	5	the	the	DET
ap-1682	94	6	weight	weight	NOUN
ap-1682	94	7	variable	variable	ADJ
ap-1682	94	8	units	unit	NOUN
ap-1682	94	9	discrete	discrete	VERB
ap-1682	94	10	optimization	optimization	NOUN
ap-1682	94	11	continuous	continuous	ADJ
ap-1682	94	12	optimization	optimization	NOUN
ap-1682	94	13	e	e	X
ap-1682	94	14	b&b	b&b	PROPN
ap-1682	94	15	fmincon	fmincon	NOUN
ap-1682	94	16	(	(	PUNCT
ap-1682	94	17	)	)	PUNCT
ap-1682	94	18	a1	a1	NOUN
ap-1682	94	19	in2	in2	PROPN
ap-1682	94	20	0.05	0.05	NUM
ap-1682	94	21	0.05	0.05	NUM
ap-1682	94	22	0.0500	0.0500	NUM
ap-1682	94	23	a2	a2	PROPN
ap-1682	94	24	in2	in2	PROPN
ap-1682	94	25	0.01	0.01	NUM
ap-1682	94	26	0.01	0.01	NUM
ap-1682	94	27	0.01	0.01	NUM
ap-1682	94	28	a3	a3	NOUN
ap-1682	94	29	in2	in2	PROPN
ap-1682	94	30	0.06	0.06	NUM
ap-1682	94	31	0.06	0.06	NUM
ap-1682	94	32	0.0471	0.0471	NUM
ap-1682	94	33	a4	a4	NOUN
ap-1682	94	34	in2	in2	PROPN
ap-1682	94	35	0.02	0.02	NUM
ap-1682	94	36	0.02	0.02	NUM
ap-1682	94	37	0.0167	0.0167	NUM
ap-1682	94	38	a5	a5	PROPN
ap-1682	94	39	in2	in2	X
ap-1682	94	40	0.01	0.01	NUM
ap-1682	94	41	0.01	0.01	NUM
ap-1682	94	42	0.01	0.01	NUM
ap-1682	94	43	m	m	NOUN
ap-1682	94	44	lb	lb	NUM
ap-1682	94	45	0.179	0.179	NUM
ap-1682	94	46	0.179	0.179	NUM
ap-1682	94	47	0.157	0.157	NUM
ap-1682	94	48	max	max	NOUN
ap-1682	94	49	|wj	|wj	X
ap-1682	94	50	|	|	ADV
ap-1682	94	51	in	in	ADP
ap-1682	94	52	0.059	0.059	NUM
ap-1682	94	53	0.059	0.059	NUM
ap-1682	94	54	0.06	0.06	NUM
ap-1682	94	55	max	max	PROPN
ap-1682	94	56	|σi|	|σi|	PROPN
ap-1682	94	57	ksi	ksi	PROPN
ap-1682	94	58	59.371	59.371	NUM
ap-1682	94	59	59.371	59.371	NUM
ap-1682	94	60	60.006	60.006	NUM
ap-1682	94	61	wlim	wlim	NOUN
ap-1682	94	62	in	in	ADP
ap-1682	94	63	0.06	0.06	NUM
ap-1682	94	64	0.06	0.06	NUM
ap-1682	94	65	0.06	0.06	NUM
ap-1682	94	66	σlim	σlim	NOUN
ap-1682	94	67	ksi	ksi	NOUN
ap-1682	94	68	60	60	NUM
ap-1682	94	69	60	60	NUM
ap-1682	94	70	60	60	NUM
ap-1682	94	71	table	table	NOUN
ap-1682	94	72	1	1	NUM
ap-1682	94	73	:	:	SYM
ap-1682	94	74	5	5	NUM
ap-1682	94	75	-	-	PUNCT
ap-1682	94	76	bar	bar	NOUN
ap-1682	94	77	truss	truss	NOUN
ap-1682	94	78	optima	optima	NOUN
ap-1682	94	79	.	.	PUNCT
ap-1682	95	1	b&b	b&b	PROPN
ap-1682	95	2	—	—	PUNCT
ap-1682	95	3	method	method	NOUN
ap-1682	95	4	based	base	VERB
ap-1682	95	5	on	on	ADP
ap-1682	95	6	branch	branch	NOUN
ap-1682	95	7	and	and	CCONJ
ap-1682	95	8	bound	bind	VERB
ap-1682	95	9	principles	principle	NOUN
ap-1682	95	10	,	,	PUNCT
ap-1682	95	11	e	e	X
ap-1682	95	12	—	—	PUNCT
ap-1682	95	13	enumeration	enumeration	NOUN
ap-1682	95	14	.	.	PUNCT
ap-1682	96	1	of	of	ADP
ap-1682	96	2	the	the	DET
ap-1682	96	3	structure	structure	NOUN
ap-1682	96	4	m	m	NOUN
ap-1682	96	5	=	=	SYM
ap-1682	96	6	f(a	f(a	NOUN
ap-1682	96	7	)	)	PUNCT
ap-1682	96	8	=	=	SYM
ap-1682	97	1	ρ	ρ	PROPN
ap-1682	97	2	n∑	n∑	PROPN
ap-1682	97	3	i=1	i=1	PROPN
ap-1682	97	4	aili	aili	NOUN
ap-1682	97	5	,	,	PUNCT
ap-1682	97	6	(	(	PUNCT
ap-1682	97	7	1	1	X
ap-1682	97	8	)	)	PUNCT
ap-1682	97	9	where	where	SCONJ
ap-1682	97	10	n	n	NOUN
ap-1682	97	11	=	=	SYM
ap-1682	97	12	5	5	NUM
ap-1682	97	13	is	be	AUX
ap-1682	97	14	the	the	DET
ap-1682	97	15	number	number	NOUN
ap-1682	97	16	of	of	ADP
ap-1682	97	17	truss	truss	ADJ
ap-1682	97	18	bars	bar	NOUN
ap-1682	97	19	,	,	PUNCT
ap-1682	97	20	ai	ai	VERB
ap-1682	97	21	is	be	AUX
ap-1682	97	22	the	the	DET
ap-1682	97	23	cross	cross	ADJ
ap-1682	97	24	-	-	ADJ
ap-1682	97	25	sectional	sectional	ADJ
ap-1682	97	26	area	area	NOUN
ap-1682	97	27	and	and	CCONJ
ap-1682	97	28	li	li	PROPN
ap-1682	97	29	is	be	AUX
ap-1682	97	30	the	the	DET
ap-1682	97	31	length	length	NOUN
ap-1682	97	32	of	of	ADP
ap-1682	97	33	element	element	NOUN
ap-1682	97	34	i	i	PROPN
ap-1682	97	35	,	,	PUNCT
ap-1682	97	36	and	and	CCONJ
ap-1682	97	37	ρ	ρ	PROPN
ap-1682	97	38	is	be	AUX
ap-1682	97	39	the	the	DET
ap-1682	97	40	density	density	NOUN
ap-1682	97	41	of	of	ADP
ap-1682	97	42	the	the	DET
ap-1682	97	43	material	material	NOUN
ap-1682	97	44	.	.	PUNCT
ap-1682	98	1	constraints	constraint	NOUN
ap-1682	98	2	are	be	AUX
ap-1682	98	3	defined	define	VERB
ap-1682	98	4	as	as	ADP
ap-1682	98	5	inequalities	inequality	NOUN
ap-1682	98	6	:	:	PUNCT
ap-1682	98	7	max	max	PROPN
ap-1682	98	8	|σi|	|σi|	PROPN
ap-1682	98	9	−	−	PROPN
ap-1682	99	1	60	60	NUM
ap-1682	99	2	≤	≤	NUM
ap-1682	99	3	0	0	NUM
ap-1682	99	4	,	,	PUNCT
ap-1682	99	5	(	(	PUNCT
ap-1682	99	6	2	2	X
ap-1682	99	7	)	)	PUNCT
ap-1682	99	8	max	max	NOUN
ap-1682	99	9	|wj	|wj	X
ap-1682	99	10	|	|	ADV
ap-1682	99	11	−	−	PROPN
ap-1682	99	12	0.06	0.06	NUM
ap-1682	99	13	≤	≤	NUM
ap-1682	99	14	0	0	NUM
ap-1682	99	15	,	,	PUNCT
ap-1682	99	16	(	(	PUNCT
ap-1682	99	17	3	3	X
ap-1682	99	18	)	)	PUNCT
ap-1682	99	19	where	where	SCONJ
ap-1682	99	20	max	max	PROPN
ap-1682	99	21	|σi|	|σi|	PROPN
ap-1682	99	22	is	be	AUX
ap-1682	99	23	the	the	DET
ap-1682	99	24	maximum	maximum	ADJ
ap-1682	99	25	absolute	absolute	ADJ
ap-1682	99	26	value	value	NOUN
ap-1682	99	27	of	of	ADP
ap-1682	99	28	stresses	stress	NOUN
ap-1682	99	29	,	,	PUNCT
ap-1682	99	30	j	j	PROPN
ap-1682	99	31	is	be	AUX
ap-1682	99	32	an	an	DET
ap-1682	99	33	ordinal	ordinal	ADJ
ap-1682	99	34	number	number	NOUN
ap-1682	99	35	of	of	ADP
ap-1682	99	36	independent	independent	ADJ
ap-1682	99	37	displacements	displacement	NOUN
ap-1682	99	38	and	and	CCONJ
ap-1682	99	39	max	max	PROPN
ap-1682	99	40	|wj	|wj	X
ap-1682	99	41	|	|	ADV
ap-1682	99	42	is	be	AUX
ap-1682	99	43	the	the	DET
ap-1682	99	44	maximum	maximum	ADJ
ap-1682	99	45	absolute	absolute	ADJ
ap-1682	99	46	value	value	NOUN
ap-1682	99	47	of	of	ADP
ap-1682	99	48	displacements	displacement	NOUN
ap-1682	99	49	.	.	PUNCT
ap-1682	100	1	these	these	DET
ap-1682	100	2	values	value	NOUN
ap-1682	100	3	can	can	AUX
ap-1682	100	4	be	be	AUX
ap-1682	100	5	obtained	obtain	VERB
ap-1682	100	6	by	by	ADP
ap-1682	100	7	several	several	ADJ
ap-1682	100	8	methods	method	NOUN
ap-1682	100	9	.	.	PUNCT
ap-1682	101	1	in	in	ADP
ap-1682	101	2	this	this	DET
ap-1682	101	3	paper	paper	NOUN
ap-1682	101	4	,	,	PUNCT
ap-1682	101	5	geometrically	geometrically	ADV
ap-1682	101	6	and	and	CCONJ
ap-1682	101	7	physically	physically	ADV
ap-1682	101	8	linear	linear	ADJ
ap-1682	101	9	behaviour	behaviour	NOUN
ap-1682	101	10	was	be	AUX
ap-1682	101	11	assumed	assume	VERB
ap-1682	101	12	and	and	CCONJ
ap-1682	101	13	the	the	DET
ap-1682	101	14	finite	finite	PROPN
ap-1682	101	15	element	element	NOUN
ap-1682	101	16	method	method	NOUN
ap-1682	101	17	was	be	AUX
ap-1682	101	18	used	use	VERB
ap-1682	101	19	,	,	PUNCT
ap-1682	101	20	see	see	VERB
ap-1682	102	1	e.g.	e.g.	ADV
ap-1682	102	2	[	[	X
ap-1682	102	3	9	9	NUM
ap-1682	102	4	]	]	PUNCT
ap-1682	102	5	.	.	PUNCT
ap-1682	103	1	the	the	DET
ap-1682	103	2	results	result	NOUN
ap-1682	103	3	for	for	ADP
ap-1682	103	4	the	the	DET
ap-1682	103	5	continuous	continuous	ADJ
ap-1682	103	6	optimization	optimization	NOUN
ap-1682	103	7	problem	problem	NOUN
ap-1682	103	8	of	of	ADP
ap-1682	103	9	the	the	DET
ap-1682	103	10	5	5	NUM
ap-1682	103	11	-	-	PUNCT
ap-1682	103	12	bar	bar	NOUN
ap-1682	103	13	truss	truss	NOUN
ap-1682	103	14	appear	appear	VERB
ap-1682	103	15	in	in	ADP
ap-1682	103	16	tab	tab	NOUN
ap-1682	103	17	.	.	PUNCT
ap-1682	104	1	1	1	X
ap-1682	104	2	.	.	PUNCT
ap-1682	105	1	the	the	DET
ap-1682	105	2	objective	objective	ADJ
ap-1682	105	3	function	function	NOUN
ap-1682	105	4	value	value	NOUN
ap-1682	105	5	of	of	ADP
ap-1682	105	6	the	the	DET
ap-1682	105	7	optima	optima	PROPN
ap-1682	105	8	obtained	obtain	VERB
ap-1682	105	9	with	with	ADP
ap-1682	105	10	the	the	DET
ap-1682	105	11	active	active	ADJ
ap-1682	105	12	set	set	NOUN
ap-1682	105	13	method	method	NOUN
ap-1682	105	14	is	be	AUX
ap-1682	105	15	later	later	ADV
ap-1682	105	16	used	use	VERB
ap-1682	105	17	as	as	ADP
ap-1682	105	18	the	the	DET
ap-1682	105	19	lower	lower	ADV
ap-1682	105	20	bound	bind	VERB
ap-1682	105	21	for	for	ADP
ap-1682	105	22	the	the	DET
ap-1682	105	23	branch	branch	NOUN
ap-1682	105	24	and	and	CCONJ
ap-1682	105	25	bound	bind	VERB
ap-1682	105	26	method	method	NOUN
ap-1682	105	27	.	.	PUNCT
ap-1682	106	1	dealing	deal	VERB
ap-1682	106	2	with	with	ADP
ap-1682	106	3	inequalities	inequality	NOUN
ap-1682	106	4	in	in	ADP
ap-1682	106	5	the	the	DET
ap-1682	106	6	form	form	NOUN
ap-1682	106	7	of	of	ADP
ap-1682	106	8	equalities	equality	NOUN
ap-1682	106	9	is	be	AUX
ap-1682	106	10	solved	solve	VERB
ap-1682	106	11	by	by	ADP
ap-1682	106	12	a	a	DET
ap-1682	106	13	penalty	penalty	NOUN
ap-1682	106	14	type	type	NOUN
ap-1682	106	15	approach	approach	NOUN
ap-1682	106	16	,	,	PUNCT
ap-1682	106	17	and	and	CCONJ
ap-1682	106	18	therefore	therefore	ADV
ap-1682	106	19	the	the	DET
ap-1682	106	20	exact	exact	ADJ
ap-1682	106	21	fulfillment	fulfillment	NOUN
ap-1682	106	22	of	of	ADP
ap-1682	106	23	the	the	DET
ap-1682	106	24	constraints	constraint	NOUN
ap-1682	106	25	therefore	therefore	ADV
ap-1682	106	26	can	can	AUX
ap-1682	106	27	not	not	PART
ap-1682	106	28	be	be	AUX
ap-1682	106	29	ensured	ensure	VERB
ap-1682	106	30	,	,	PUNCT
ap-1682	106	31	see	see	VERB
ap-1682	106	32	table	table	NOUN
ap-1682	106	33	1	1	NUM
ap-1682	106	34	.	.	PUNCT
ap-1682	107	1	this	this	DET
ap-1682	107	2	discrepancy	discrepancy	NOUN
ap-1682	107	3	is	be	AUX
ap-1682	107	4	not	not	PART
ap-1682	107	5	crucial	crucial	ADJ
ap-1682	107	6	since	since	SCONJ
ap-1682	107	7	only	only	ADV
ap-1682	107	8	a	a	DET
ap-1682	107	9	lower	low	ADJ
ap-1682	107	10	bound	bind	VERB
ap-1682	107	11	is	be	AUX
ap-1682	107	12	needed	need	VERB
ap-1682	107	13	,	,	PUNCT
ap-1682	107	14	not	not	PART
ap-1682	107	15	the	the	DET
ap-1682	107	16	global	global	ADJ
ap-1682	107	17	continuous	continuous	ADJ
ap-1682	107	18	optimum	optimum	NOUN
ap-1682	107	19	.	.	PUNCT
ap-1682	108	1	an	an	DET
ap-1682	108	2	identical	identical	ADJ
ap-1682	108	3	topology	topology	NOUN
ap-1682	108	4	of	of	ADP
ap-1682	108	5	the	the	DET
ap-1682	108	6	5	5	NUM
ap-1682	108	7	-	-	PUNCT
ap-1682	108	8	bar	bar	NOUN
ap-1682	108	9	truss	truss	NOUN
ap-1682	108	10	is	be	AUX
ap-1682	108	11	used	use	VERB
ap-1682	108	12	for	for	ADP
ap-1682	108	13	the	the	DET
ap-1682	108	14	discrete	discrete	ADJ
ap-1682	108	15	optimization	optimization	NOUN
ap-1682	108	16	version	version	NOUN
ap-1682	108	17	.	.	PUNCT
ap-1682	109	1	the	the	DET
ap-1682	109	2	material	material	NOUN
ap-1682	109	3	properties	property	NOUN
ap-1682	109	4	and	and	CCONJ
ap-1682	109	5	constraints	constraint	NOUN
ap-1682	109	6	are	be	AUX
ap-1682	109	7	also	also	ADV
ap-1682	109	8	identical	identical	ADJ
ap-1682	109	9	.	.	PUNCT
ap-1682	110	1	76	76	NUM
ap-1682	110	2	acta	acta	PROPN
ap-1682	110	3	polytechnica	polytechnica	PROPN
ap-1682	110	4	vol	vol	NOUN
ap-1682	110	5	.	.	PROPN
ap-1682	111	1	52	52	NUM
ap-1682	111	2	no	no	NOUN
ap-1682	111	3	.	.	PUNCT
ap-1682	112	1	6/2012	6/2012	NUM
ap-1682	112	2	initialization	initialization	NOUN
ap-1682	112	3	set	set	VERB
ap-1682	112	4	variables	variable	NOUN
ap-1682	112	5	to	to	ADP
ap-1682	112	6	the	the	DET
ap-1682	112	7	smallest	small	ADJ
ap-1682	112	8	values	value	NOUN
ap-1682	112	9	compute	compute	VERB
ap-1682	112	10	m	m	VERB
ap-1682	112	11	compare	compare	VERB
ap-1682	112	12	m	m	VERB
ap-1682	112	13	with	with	ADP
ap-1682	112	14	mmin	mmin	ADJ
ap-1682	112	15	and	and	CCONJ
ap-1682	112	16	mmax	mmax	ADJ
ap-1682	112	17	compute	compute	NOUN
ap-1682	112	18	constraints	constraint	NOUN
ap-1682	112	19	are	be	AUX
ap-1682	112	20	they	they	PRON
ap-1682	112	21	satisfied	satisfied	ADJ
ap-1682	112	22	?	?	PUNCT
ap-1682	113	1	mmin	mmin	ADJ
ap-1682	113	2	≤	≤	NUM
ap-1682	113	3	m	m	VERB
ap-1682	113	4	<	<	X
ap-1682	113	5	mmax	mmax	NOUN
ap-1682	114	1	yes	yes	INTJ
ap-1682	114	2	m	m	VERB
ap-1682	114	3	<	<	X
ap-1682	114	4	mmax	mmax	NOUN
ap-1682	114	5	?	?	PUNCT
ap-1682	115	1	yes	yes	INTJ
ap-1682	115	2	mmax	mmax	ADV
ap-1682	116	1	=	=	PUNCT
ap-1682	116	2	m	m	AUX
ap-1682	116	3	increase	increase	VERB
ap-1682	116	4	last	last	ADJ
ap-1682	116	5	variable	variable	NOUN
ap-1682	116	6	by	by	ADP
ap-1682	116	7	one	one	NUM
ap-1682	116	8	compute	compute	NOUN
ap-1682	116	9	m	m	NOUN
ap-1682	116	10	no	no	DET
ap-1682	116	11	find	find	NOUN
ap-1682	116	12	combination	combination	NOUN
ap-1682	116	13	m	m	VERB
ap-1682	116	14	>	>	X
ap-1682	116	15	mmin	mmin	PROPN
ap-1682	116	16	m	m	PROPN
ap-1682	116	17	<	<	X
ap-1682	116	18	mmin	mmin	PROPN
ap-1682	116	19	m	m	PROPN
ap-1682	116	20	≥	≥	NOUN
ap-1682	116	21	mmax	mmax	NOUN
ap-1682	116	22	are	be	AUX
ap-1682	116	23	all	all	DET
ap-1682	116	24	variables	variable	NOUN
ap-1682	116	25	set	set	VERB
ap-1682	116	26	to	to	ADP
ap-1682	116	27	the	the	DET
ap-1682	116	28	highest	high	ADJ
ap-1682	116	29	values	value	NOUN
ap-1682	116	30	?	?	PUNCT
ap-1682	117	1	find	find	VERB
ap-1682	117	2	combination	combination	NOUN
ap-1682	117	3	m	m	VERB
ap-1682	117	4	<	<	X
ap-1682	117	5	mmax	mmax	NOUN
ap-1682	117	6	no	no	DET
ap-1682	117	7	end	end	NOUN
ap-1682	118	1	yes	yes	INTJ
ap-1682	118	2	no	no	DET
ap-1682	118	3	step	step	NOUN
ap-1682	118	4	1	1	NUM
ap-1682	118	5	step	step	NOUN
ap-1682	118	6	2	2	NUM
ap-1682	118	7	step	step	NOUN
ap-1682	118	8	3	3	NUM
ap-1682	118	9	step	step	NOUN
ap-1682	118	10	4	4	NUM
ap-1682	118	11	step	step	NOUN
ap-1682	118	12	5	5	NUM
ap-1682	118	13	step	step	NOUN
ap-1682	118	14	6	6	NUM
ap-1682	118	15	figure	figure	NOUN
ap-1682	118	16	2	2	NUM
ap-1682	118	17	:	:	PUNCT
ap-1682	118	18	a	a	DET
ap-1682	118	19	flow	flow	NOUN
ap-1682	118	20	chart	chart	NOUN
ap-1682	118	21	of	of	ADP
ap-1682	118	22	the	the	DET
ap-1682	118	23	algorithm	algorithm	NOUN
ap-1682	118	24	.	.	PUNCT
ap-1682	119	1	the	the	DET
ap-1682	119	2	cross	cross	ADJ
ap-1682	119	3	-	-	ADJ
ap-1682	119	4	sectional	sectional	ADJ
ap-1682	119	5	areas	area	NOUN
ap-1682	119	6	are	be	AUX
ap-1682	119	7	chosen	choose	VERB
ap-1682	119	8	from	from	ADP
ap-1682	119	9	the	the	DET
ap-1682	119	10	set	set	NOUN
ap-1682	119	11	{	{	PUNCT
ap-1682	119	12	0.01	0.01	NUM
ap-1682	119	13	,	,	PUNCT
ap-1682	119	14	0.02	0.02	NUM
ap-1682	119	15	,	,	PUNCT
ap-1682	119	16	.	.	PUNCT
ap-1682	119	17	.	.	PUNCT
ap-1682	120	1	.	.	PUNCT
ap-1682	121	1	,	,	PUNCT
ap-1682	121	2	0.1	0.1	NUM
ap-1682	121	3	}	}	PUNCT
ap-1682	121	4	in2	in2	PROPN
ap-1682	121	5	.	.	PUNCT
ap-1682	122	1	since	since	SCONJ
ap-1682	122	2	the	the	DET
ap-1682	122	3	structure	structure	NOUN
ap-1682	122	4	has	have	VERB
ap-1682	122	5	five	five	NUM
ap-1682	122	6	elements	element	NOUN
ap-1682	122	7	(	(	PUNCT
ap-1682	122	8	k	k	NOUN
ap-1682	122	9	=	=	SYM
ap-1682	122	10	5	5	NUM
ap-1682	122	11	)	)	PUNCT
ap-1682	122	12	and	and	CCONJ
ap-1682	122	13	10	10	NUM
ap-1682	122	14	cross	cross	ADJ
ap-1682	122	15	-	-	ADJ
ap-1682	122	16	sectional	sectional	ADJ
ap-1682	122	17	areas	area	NOUN
ap-1682	122	18	(	(	PUNCT
ap-1682	122	19	n	n	NOUN
ap-1682	122	20	=	=	SYM
ap-1682	122	21	10	10	NUM
ap-1682	122	22	)	)	PUNCT
ap-1682	122	23	,	,	PUNCT
ap-1682	122	24	the	the	DET
ap-1682	122	25	number	number	NOUN
ap-1682	122	26	of	of	ADP
ap-1682	122	27	all	all	DET
ap-1682	122	28	possible	possible	ADJ
ap-1682	122	29	solutions	solution	NOUN
ap-1682	122	30	is	be	AUX
ap-1682	122	31	nk	nk	PROPN
ap-1682	122	32	=	=	PROPN
ap-1682	122	33	105	105	NUM
ap-1682	122	34	.	.	PUNCT
ap-1682	123	1	therefore	therefore	ADV
ap-1682	123	2	,	,	PUNCT
ap-1682	123	3	the	the	DET
ap-1682	123	4	structure	structure	NOUN
ap-1682	123	5	is	be	AUX
ap-1682	123	6	small	small	ADJ
ap-1682	123	7	enough	enough	ADV
ap-1682	123	8	and	and	CCONJ
ap-1682	123	9	the	the	DET
ap-1682	123	10	discrete	discrete	ADJ
ap-1682	123	11	global	global	ADJ
ap-1682	123	12	optimum	optimum	NOUN
ap-1682	123	13	can	can	AUX
ap-1682	123	14	be	be	AUX
ap-1682	123	15	obtained	obtain	VERB
ap-1682	123	16	by	by	ADP
ap-1682	123	17	the	the	DET
ap-1682	123	18	enumeration	enumeration	NOUN
ap-1682	123	19	method	method	NOUN
ap-1682	123	20	.	.	PUNCT
ap-1682	124	1	the	the	DET
ap-1682	124	2	results	result	NOUN
ap-1682	124	3	appear	appear	VERB
ap-1682	124	4	in	in	ADP
ap-1682	124	5	tab	tab	NOUN
ap-1682	124	6	.	.	PUNCT
ap-1682	125	1	1	1	X
ap-1682	125	2	.	.	X
ap-1682	125	3	the	the	DET
ap-1682	125	4	lower	lower	ADV
ap-1682	125	5	bound	bind	VERB
ap-1682	125	6	for	for	ADP
ap-1682	125	7	the	the	DET
ap-1682	125	8	branch	branch	NOUN
ap-1682	125	9	and	and	CCONJ
ap-1682	125	10	bound	bind	VERB
ap-1682	125	11	method	method	NOUN
ap-1682	125	12	is	be	AUX
ap-1682	125	13	set	set	VERB
ap-1682	125	14	to	to	ADP
ap-1682	125	15	the	the	DET
ap-1682	125	16	optimum	optimum	ADJ
ap-1682	125	17	objective	objective	ADJ
ap-1682	125	18	function	function	NOUN
ap-1682	125	19	value	value	NOUN
ap-1682	125	20	obtained	obtain	VERB
ap-1682	125	21	with	with	ADP
ap-1682	125	22	continuous	continuous	ADJ
ap-1682	125	23	variables	variable	NOUN
ap-1682	125	24	.	.	PUNCT
ap-1682	126	1	the	the	DET
ap-1682	126	2	upper	upper	ADJ
ap-1682	126	3	bound	bind	VERB
ap-1682	126	4	is	be	AUX
ap-1682	126	5	set	set	VERB
ap-1682	126	6	to	to	ADP
ap-1682	126	7	the	the	DET
ap-1682	126	8	estimated	estimate	VERB
ap-1682	126	9	weight	weight	NOUN
ap-1682	126	10	of	of	ADP
ap-1682	126	11	0.23	0.23	NUM
ap-1682	126	12	lb	lb	NOUN
ap-1682	126	13	,	,	PUNCT
ap-1682	126	14	which	which	PRON
ap-1682	126	15	is	be	AUX
ap-1682	126	16	25	25	NUM
ap-1682	126	17	%	%	NOUN
ap-1682	126	18	higher	high	ADJ
ap-1682	126	19	than	than	ADP
ap-1682	126	20	the	the	DET
ap-1682	126	21	global	global	ADJ
ap-1682	126	22	optimum	optimum	ADJ
ap-1682	126	23	value	value	NOUN
ap-1682	126	24	of	of	ADP
ap-1682	126	25	the	the	DET
ap-1682	126	26	objective	objective	ADJ
ap-1682	126	27	function	function	NOUN
ap-1682	126	28	obtained	obtain	VERB
ap-1682	126	29	by	by	ADP
ap-1682	126	30	the	the	DET
ap-1682	126	31	enumeration	enumeration	NOUN
ap-1682	126	32	.	.	PUNCT
ap-1682	127	1	the	the	DET
ap-1682	127	2	space	space	NOUN
ap-1682	127	3	is	be	AUX
ap-1682	127	4	searched	search	VERB
ap-1682	127	5	systematically	systematically	ADV
ap-1682	127	6	between	between	ADP
ap-1682	127	7	these	these	DET
ap-1682	127	8	two	two	NUM
ap-1682	127	9	bounds	bound	NOUN
ap-1682	127	10	until	until	SCONJ
ap-1682	127	11	the	the	DET
ap-1682	127	12	global	global	ADJ
ap-1682	127	13	optimum	optimum	NOUN
ap-1682	127	14	is	be	AUX
ap-1682	127	15	found	find	VERB
ap-1682	127	16	.	.	PUNCT
ap-1682	128	1	a	a	DET
ap-1682	128	2	flow	flow	NOUN
ap-1682	128	3	chart	chart	NOUN
ap-1682	128	4	of	of	ADP
ap-1682	128	5	the	the	DET
ap-1682	128	6	algorithm	algorithm	NOUN
ap-1682	128	7	is	be	AUX
ap-1682	128	8	depicted	depict	VERB
ap-1682	128	9	in	in	ADP
ap-1682	128	10	fig	fig	NOUN
ap-1682	128	11	.	.	PUNCT
ap-1682	129	1	2	2	X
ap-1682	129	2	.	.	X
ap-1682	129	3	the	the	DET
ap-1682	129	4	steps	step	NOUN
ap-1682	129	5	can	can	AUX
ap-1682	129	6	be	be	AUX
ap-1682	129	7	described	describe	VERB
ap-1682	129	8	as	as	SCONJ
ap-1682	129	9	follows	follow	VERB
ap-1682	129	10	:	:	PUNCT
ap-1682	129	11	1	1	X
ap-1682	129	12	.	.	X
ap-1682	129	13	first	first	ADV
ap-1682	129	14	,	,	PUNCT
ap-1682	129	15	we	we	PRON
ap-1682	129	16	have	have	AUX
ap-1682	129	17	to	to	PART
ap-1682	129	18	decide	decide	VERB
ap-1682	129	19	which	which	DET
ap-1682	129	20	values	value	NOUN
ap-1682	129	21	will	will	AUX
ap-1682	129	22	be	be	AUX
ap-1682	129	23	used	use	VERB
ap-1682	129	24	as	as	ADP
ap-1682	129	25	the	the	DET
ap-1682	129	26	initial	initial	ADJ
ap-1682	129	27	point	point	NOUN
ap-1682	129	28	.	.	PUNCT
ap-1682	130	1	it	it	PRON
ap-1682	130	2	is	be	AUX
ap-1682	130	3	appropriate	appropriate	ADJ
ap-1682	130	4	to	to	PART
ap-1682	130	5	begin	begin	VERB
ap-1682	130	6	with	with	ADP
ap-1682	130	7	the	the	DET
ap-1682	130	8	smallest	small	ADJ
ap-1682	130	9	profiles	profile	NOUN
ap-1682	130	10	and	and	CCONJ
ap-1682	130	11	then	then	ADV
ap-1682	130	12	increase	increase	VERB
ap-1682	130	13	them	they	PRON
ap-1682	130	14	,	,	PUNCT
ap-1682	130	15	since	since	SCONJ
ap-1682	130	16	the	the	DET
ap-1682	130	17	objective	objective	ADJ
ap-1682	130	18	function	function	NOUN
ap-1682	130	19	is	be	AUX
ap-1682	130	20	linear	linear	ADJ
ap-1682	130	21	with	with	ADP
ap-1682	130	22	respect	respect	NOUN
ap-1682	130	23	to	to	ADP
ap-1682	130	24	the	the	DET
ap-1682	130	25	cross	cross	ADJ
ap-1682	130	26	-	-	ADJ
ap-1682	130	27	section	section	ADJ
ap-1682	130	28	areas	area	NOUN
ap-1682	130	29	.	.	PUNCT
ap-1682	131	1	from	from	ADP
ap-1682	131	2	the	the	DET
ap-1682	131	3	programming	programming	NOUN
ap-1682	131	4	point	point	NOUN
ap-1682	131	5	of	of	ADP
ap-1682	131	6	view	view	NOUN
ap-1682	131	7	,	,	PUNCT
ap-1682	131	8	it	it	PRON
ap-1682	131	9	is	be	AUX
ap-1682	131	10	easier	easy	ADJ
ap-1682	131	11	to	to	PART
ap-1682	131	12	use	use	VERB
ap-1682	131	13	integer	integer	NOUN
ap-1682	131	14	variables	variable	NOUN
ap-1682	131	15	that	that	PRON
ap-1682	131	16	are	be	AUX
ap-1682	131	17	the	the	DET
ap-1682	131	18	ordinal	ordinal	ADJ
ap-1682	131	19	numbers	number	NOUN
ap-1682	131	20	of	of	ADP
ap-1682	131	21	the	the	DET
ap-1682	131	22	given	give	VERB
ap-1682	131	23	set	set	NOUN
ap-1682	131	24	of	of	ADP
ap-1682	131	25	cross	cross	ADJ
ap-1682	131	26	-	-	ADJ
ap-1682	131	27	sectional	sectional	ADJ
ap-1682	131	28	areas	area	NOUN
ap-1682	131	29	—	—	PUNCT
ap-1682	131	30	set	set	VERB
ap-1682	131	31	m	m	PRON
ap-1682	131	32	.	.	PUNCT
ap-1682	132	1	for	for	ADP
ap-1682	132	2	example	example	NOUN
ap-1682	132	3	,	,	PUNCT
ap-1682	132	4	the	the	DET
ap-1682	132	5	initial	initial	ADJ
ap-1682	132	6	design	design	NOUN
ap-1682	132	7	variable	variable	ADJ
ap-1682	132	8	vector	vector	NOUN
ap-1682	132	9	is	be	AUX
ap-1682	132	10	1	1	NUM
ap-1682	132	11	1	1	NUM
ap-1682	132	12	1	1	NUM
ap-1682	132	13	1	1	NUM
ap-1682	132	14	1	1	NUM
ap-1682	132	15	,	,	PUNCT
ap-1682	132	16	which	which	PRON
ap-1682	132	17	means	mean	VERB
ap-1682	132	18	that	that	SCONJ
ap-1682	132	19	the	the	DET
ap-1682	132	20	first	first	ADJ
ap-1682	132	21	area	area	NOUN
ap-1682	132	22	(	(	PUNCT
ap-1682	132	23	0.01	0.01	NUM
ap-1682	132	24	in2	in2	PROPN
ap-1682	132	25	)	)	PUNCT
ap-1682	132	26	from	from	ADP
ap-1682	132	27	the	the	DET
ap-1682	132	28	given	give	VERB
ap-1682	132	29	set	set	NOUN
ap-1682	132	30	is	be	AUX
ap-1682	132	31	attached	attach	VERB
ap-1682	132	32	to	to	ADP
ap-1682	132	33	each	each	DET
ap-1682	132	34	truss	truss	NOUN
ap-1682	132	35	bar	bar	NOUN
ap-1682	132	36	,	,	PUNCT
ap-1682	132	37	according	accord	VERB
ap-1682	132	38	to	to	ADP
ap-1682	132	39	the	the	DET
ap-1682	132	40	numbering	numbering	NOUN
ap-1682	132	41	of	of	ADP
ap-1682	132	42	the	the	DET
ap-1682	132	43	trusses	truss	NOUN
ap-1682	132	44	shown	show	VERB
ap-1682	132	45	in	in	ADP
ap-1682	132	46	fig	fig	NOUN
ap-1682	132	47	.	.	PUNCT
ap-1682	133	1	1	1	NUM
ap-1682	133	2	.	.	X
ap-1682	134	1	2	2	NUM
ap-1682	134	2	.	.	X
ap-1682	135	1	the	the	DET
ap-1682	135	2	value	value	NOUN
ap-1682	135	3	of	of	ADP
ap-1682	135	4	the	the	DET
ap-1682	135	5	objective	objective	ADJ
ap-1682	135	6	function	function	NOUN
ap-1682	135	7	is	be	AUX
ap-1682	135	8	then	then	ADV
ap-1682	135	9	calculated	calculate	VERB
ap-1682	135	10	and	and	CCONJ
ap-1682	135	11	compared	compare	VERB
ap-1682	135	12	with	with	ADP
ap-1682	135	13	the	the	DET
ap-1682	135	14	lower	low	ADJ
ap-1682	135	15	mmin	mmin	ADJ
ap-1682	135	16	and	and	CCONJ
ap-1682	135	17	upper	upper	ADJ
ap-1682	135	18	mmax	mmax	NOUN
ap-1682	135	19	bounds	bound	NOUN
ap-1682	135	20	.	.	PUNCT
ap-1682	136	1	if	if	SCONJ
ap-1682	136	2	the	the	DET
ap-1682	136	3	weight	weight	NOUN
ap-1682	136	4	of	of	ADP
ap-1682	136	5	the	the	DET
ap-1682	136	6	structure	structure	NOUN
ap-1682	136	7	is	be	AUX
ap-1682	136	8	less	less	ADJ
ap-1682	136	9	than	than	ADP
ap-1682	136	10	mmin	mmin	ADJ
ap-1682	136	11	,	,	PUNCT
ap-1682	136	12	the	the	DET
ap-1682	136	13	algorithm	algorithm	NOUN
ap-1682	136	14	will	will	AUX
ap-1682	136	15	go	go	VERB
ap-1682	136	16	to	to	PART
ap-1682	136	17	step	step	VERB
ap-1682	136	18	3	3	NUM
ap-1682	136	19	.	.	PUNCT
ap-1682	137	1	if	if	SCONJ
ap-1682	137	2	the	the	DET
ap-1682	137	3	weight	weight	NOUN
ap-1682	137	4	of	of	ADP
ap-1682	137	5	the	the	DET
ap-1682	137	6	structure	structure	NOUN
ap-1682	137	7	is	be	AUX
ap-1682	137	8	between	between	ADP
ap-1682	137	9	mmin	mmin	NOUN
ap-1682	137	10	and	and	CCONJ
ap-1682	137	11	mmax	mmax	NOUN
ap-1682	137	12	,	,	PUNCT
ap-1682	137	13	the	the	DET
ap-1682	137	14	algorithm	algorithm	NOUN
ap-1682	137	15	proceeds	proceed	VERB
ap-1682	137	16	to	to	PART
ap-1682	137	17	step	step	VERB
ap-1682	137	18	4	4	NUM
ap-1682	137	19	.	.	PUNCT
ap-1682	138	1	if	if	SCONJ
ap-1682	138	2	the	the	DET
ap-1682	138	3	weight	weight	NOUN
ap-1682	138	4	of	of	ADP
ap-1682	138	5	the	the	DET
ap-1682	138	6	structure	structure	NOUN
ap-1682	138	7	is	be	AUX
ap-1682	138	8	greater	great	ADJ
ap-1682	138	9	than	than	ADP
ap-1682	138	10	mmax	mmax	NOUN
ap-1682	138	11	,	,	PUNCT
ap-1682	138	12	step	step	NOUN
ap-1682	138	13	5	5	NUM
ap-1682	138	14	is	be	AUX
ap-1682	138	15	executed	execute	VERB
ap-1682	138	16	.	.	PUNCT
ap-1682	139	1	3	3	X
ap-1682	139	2	.	.	X
ap-1682	139	3	the	the	DET
ap-1682	139	4	value	value	NOUN
ap-1682	139	5	of	of	ADP
ap-1682	139	6	the	the	DET
ap-1682	139	7	objective	objective	ADJ
ap-1682	139	8	function	function	NOUN
ap-1682	139	9	is	be	AUX
ap-1682	139	10	less	less	ADJ
ap-1682	139	11	than	than	ADP
ap-1682	139	12	mmin	mmin	ADJ
ap-1682	139	13	.	.	PUNCT
ap-1682	140	1	it	it	PRON
ap-1682	140	2	is	be	AUX
ap-1682	140	3	therefore	therefore	ADV
ap-1682	140	4	necessary	necessary	ADJ
ap-1682	140	5	to	to	PART
ap-1682	140	6	find	find	VERB
ap-1682	140	7	a	a	DET
ap-1682	140	8	combination	combination	NOUN
ap-1682	140	9	of	of	ADP
ap-1682	140	10	variables	variable	NOUN
ap-1682	140	11	that	that	PRON
ap-1682	140	12	corresponds	correspond	VERB
ap-1682	140	13	to	to	ADP
ap-1682	140	14	weight	weight	NOUN
ap-1682	140	15	larger	large	ADJ
ap-1682	140	16	than	than	ADP
ap-1682	140	17	mmin	mmin	NOUN
ap-1682	140	18	.	.	PUNCT
ap-1682	141	1	the	the	DET
ap-1682	141	2	last	last	ADJ
ap-1682	141	3	variable	variable	NOUN
ap-1682	141	4	is	be	AUX
ap-1682	141	5	raised	raise	VERB
ap-1682	141	6	to	to	ADP
ap-1682	141	7	its	its	PRON
ap-1682	141	8	maximum	maximum	ADJ
ap-1682	141	9	value	value	NOUN
ap-1682	141	10	,	,	PUNCT
ap-1682	141	11	e.g.	e.g.	ADV
ap-1682	141	12	as	as	ADP
ap-1682	141	13	1	1	NUM
ap-1682	141	14	1	1	NUM
ap-1682	141	15	1	1	NUM
ap-1682	141	16	1	1	NUM
ap-1682	141	17	10	10	NUM
ap-1682	141	18	,	,	PUNCT
ap-1682	141	19	and	and	CCONJ
ap-1682	141	20	the	the	DET
ap-1682	141	21	value	value	NOUN
ap-1682	141	22	of	of	ADP
ap-1682	141	23	the	the	DET
ap-1682	141	24	objective	objective	ADJ
ap-1682	141	25	function	function	NOUN
ap-1682	141	26	is	be	AUX
ap-1682	141	27	calculated	calculate	VERB
ap-1682	141	28	and	and	CCONJ
ap-1682	141	29	compared	compare	VERB
ap-1682	141	30	to	to	ADP
ap-1682	141	31	mmin	mmin	NOUN
ap-1682	141	32	.	.	PUNCT
ap-1682	142	1	(	(	PUNCT
ap-1682	142	2	a	a	X
ap-1682	142	3	)	)	PUNCT
ap-1682	142	4	if	if	SCONJ
ap-1682	142	5	the	the	DET
ap-1682	142	6	value	value	NOUN
ap-1682	142	7	of	of	ADP
ap-1682	142	8	the	the	DET
ap-1682	142	9	objective	objective	ADJ
ap-1682	142	10	function	function	NOUN
ap-1682	142	11	is	be	AUX
ap-1682	142	12	still	still	ADV
ap-1682	142	13	less	less	ADJ
ap-1682	142	14	than	than	ADP
ap-1682	142	15	mmin	mmin	ADJ
ap-1682	142	16	,	,	PUNCT
ap-1682	142	17	the	the	DET
ap-1682	142	18	algorithm	algorithm	NOUN
ap-1682	142	19	searches	search	VERB
ap-1682	142	20	for	for	ADP
ap-1682	142	21	a	a	DET
ap-1682	142	22	combination	combination	NOUN
ap-1682	142	23	with	with	ADP
ap-1682	142	24	greater	great	ADJ
ap-1682	142	25	weight	weight	NOUN
ap-1682	142	26	than	than	ADP
ap-1682	142	27	the	the	DET
ap-1682	142	28	lower	lower	ADV
ap-1682	142	29	bound	bind	VERB
ap-1682	142	30	.	.	PUNCT
ap-1682	143	1	this	this	PRON
ap-1682	143	2	can	can	AUX
ap-1682	143	3	be	be	AUX
ap-1682	143	4	done	do	VERB
ap-1682	143	5	as	as	SCONJ
ap-1682	143	6	follows	follow	VERB
ap-1682	143	7	.	.	PUNCT
ap-1682	144	1	the	the	DET
ap-1682	144	2	next	next	ADJ
ap-1682	144	3	-	-	PUNCT
ap-1682	144	4	to	to	ADP
ap-1682	144	5	-	-	PUNCT
ap-1682	144	6	last	last	ADJ
ap-1682	144	7	variable	variable	NOUN
ap-1682	144	8	is	be	AUX
ap-1682	144	9	repeatedly	repeatedly	ADV
ap-1682	144	10	raised	raise	VERB
ap-1682	144	11	by	by	ADP
ap-1682	144	12	one	one	NUM
ap-1682	144	13	,	,	PUNCT
ap-1682	144	14	e.g.	e.g.	ADV
ap-1682	144	15	to	to	PART
ap-1682	144	16	(	(	PUNCT
ap-1682	144	17	1	1	NUM
ap-1682	144	18	1	1	NUM
ap-1682	144	19	1	1	NUM
ap-1682	144	20	2	2	NUM
ap-1682	144	21	10	10	NUM
ap-1682	144	22	)	)	PUNCT
ap-1682	144	23	.	.	PUNCT
ap-1682	145	1	if	if	SCONJ
ap-1682	145	2	the	the	DET
ap-1682	145	3	value	value	NOUN
ap-1682	145	4	of	of	ADP
ap-1682	145	5	the	the	DET
ap-1682	145	6	next	next	ADJ
ap-1682	145	7	-	-	PUNCT
ap-1682	145	8	to	to	ADP
ap-1682	145	9	-	-	PUNCT
ap-1682	145	10	last	last	ADJ
ap-1682	145	11	variable	variable	NOUN
ap-1682	145	12	reaches	reach	VERB
ap-1682	145	13	its	its	PRON
ap-1682	145	14	maximum	maximum	NOUN
ap-1682	145	15	,	,	PUNCT
ap-1682	145	16	it	it	PRON
ap-1682	145	17	is	be	AUX
ap-1682	145	18	decreased	decrease	VERB
ap-1682	145	19	to	to	ADP
ap-1682	145	20	its	its	PRON
ap-1682	145	21	minimum	minimum	NOUN
ap-1682	145	22	and	and	CCONJ
ap-1682	145	23	the	the	DET
ap-1682	145	24	third	third	ADJ
ap-1682	145	25	from	from	ADP
ap-1682	145	26	the	the	DET
ap-1682	145	27	end	end	NOUN
ap-1682	145	28	variable	variable	ADJ
ap-1682	145	29	value	value	NOUN
ap-1682	145	30	is	be	AUX
ap-1682	145	31	raised	raise	VERB
ap-1682	145	32	by	by	ADP
ap-1682	145	33	one	one	NUM
ap-1682	145	34	.	.	PUNCT
ap-1682	146	1	the	the	DET
ap-1682	146	2	algorithm	algorithm	NOUN
ap-1682	146	3	will	will	AUX
ap-1682	146	4	go	go	VERB
ap-1682	146	5	to	to	PART
ap-1682	146	6	step	step	VERB
ap-1682	146	7	2	2	NUM
ap-1682	146	8	at	at	ADP
ap-1682	146	9	the	the	DET
ap-1682	146	10	moment	moment	NOUN
ap-1682	146	11	when	when	SCONJ
ap-1682	146	12	all	all	DET
ap-1682	146	13	variables	variable	NOUN
ap-1682	146	14	are	be	AUX
ap-1682	146	15	set	set	VERB
ap-1682	146	16	such	such	ADJ
ap-1682	146	17	that	that	SCONJ
ap-1682	146	18	m	m	VERB
ap-1682	146	19	>	>	X
ap-1682	146	20	mmin	mmin	PROPN
ap-1682	146	21	.	.	PUNCT
ap-1682	147	1	(	(	PUNCT
ap-1682	147	2	b	b	X
ap-1682	147	3	)	)	PUNCT
ap-1682	147	4	if	if	SCONJ
ap-1682	147	5	the	the	DET
ap-1682	147	6	value	value	NOUN
ap-1682	147	7	of	of	ADP
ap-1682	147	8	the	the	DET
ap-1682	147	9	objective	objective	ADJ
ap-1682	147	10	function	function	NOUN
ap-1682	147	11	is	be	AUX
ap-1682	147	12	greater	great	ADJ
ap-1682	147	13	than	than	ADP
ap-1682	147	14	the	the	DET
ap-1682	147	15	lower	lower	ADV
ap-1682	147	16	bound	bind	VERB
ap-1682	147	17	,	,	PUNCT
ap-1682	147	18	the	the	DET
ap-1682	147	19	last	last	ADJ
ap-1682	147	20	variable	variable	ADJ
ap-1682	147	21	value	value	NOUN
ap-1682	147	22	is	be	AUX
ap-1682	147	23	decreased	decrease	VERB
ap-1682	147	24	to	to	ADP
ap-1682	147	25	its	its	PRON
ap-1682	147	26	minimum	minimum	NOUN
ap-1682	147	27	(	(	PUNCT
ap-1682	147	28	1	1	NUM
ap-1682	147	29	1	1	NUM
ap-1682	147	30	1	1	NUM
ap-1682	147	31	1	1	NUM
ap-1682	147	32	1	1	NUM
ap-1682	147	33	)	)	PUNCT
ap-1682	147	34	and	and	CCONJ
ap-1682	147	35	is	be	AUX
ap-1682	147	36	then	then	ADV
ap-1682	147	37	increased	increase	VERB
ap-1682	147	38	one	one	NUM
ap-1682	147	39	by	by	ADP
ap-1682	147	40	one	one	NUM
ap-1682	147	41	(	(	PUNCT
ap-1682	147	42	1	1	NUM
ap-1682	147	43	1	1	NUM
ap-1682	147	44	1	1	NUM
ap-1682	147	45	1	1	NUM
ap-1682	147	46	2	2	NUM
ap-1682	147	47	,	,	PUNCT
ap-1682	147	48	1	1	NUM
ap-1682	147	49	1	1	NUM
ap-1682	147	50	1	1	NUM
ap-1682	147	51	1	1	NUM
ap-1682	147	52	3	3	NUM
ap-1682	147	53	,	,	PUNCT
ap-1682	147	54	...	...	PUNCT
ap-1682	147	55	,	,	PUNCT
ap-1682	147	56	etc	etc	X
ap-1682	147	57	.	.	X
ap-1682	147	58	)	)	PUNCT
ap-1682	147	59	until	until	SCONJ
ap-1682	147	60	the	the	DET
ap-1682	147	61	weight	weight	NOUN
ap-1682	147	62	is	be	AUX
ap-1682	147	63	greater	great	ADJ
ap-1682	147	64	than	than	ADP
ap-1682	147	65	mmin	mmin	ADJ
ap-1682	147	66	.	.	PUNCT
ap-1682	148	1	if	if	SCONJ
ap-1682	148	2	mmin	mmin	PROPN
ap-1682	149	1	>	>	X
ap-1682	149	2	m	m	VERB
ap-1682	149	3	the	the	DET
ap-1682	149	4	algorithm	algorithm	NOUN
ap-1682	149	5	goes	go	VERB
ap-1682	149	6	to	to	PART
ap-1682	149	7	step	step	VERB
ap-1682	149	8	2	2	NUM
ap-1682	149	9	.	.	NOUN
ap-1682	150	1	4	4	NUM
ap-1682	150	2	.	.	X
ap-1682	151	1	the	the	DET
ap-1682	151	2	value	value	NOUN
ap-1682	151	3	of	of	ADP
ap-1682	151	4	the	the	DET
ap-1682	151	5	objective	objective	ADJ
ap-1682	151	6	function	function	NOUN
ap-1682	151	7	is	be	AUX
ap-1682	151	8	greater	great	ADJ
ap-1682	151	9	than	than	ADP
ap-1682	151	10	mmin	mmin	ADJ
ap-1682	151	11	and	and	CCONJ
ap-1682	151	12	less	less	ADJ
ap-1682	151	13	than	than	ADP
ap-1682	151	14	mmax	mmax	NOUN
ap-1682	151	15	.	.	PUNCT
ap-1682	152	1	the	the	DET
ap-1682	152	2	global	global	ADJ
ap-1682	152	3	optimum	optimum	NOUN
ap-1682	152	4	is	be	AUX
ap-1682	152	5	located	locate	VERB
ap-1682	152	6	somewhere	somewhere	ADV
ap-1682	152	7	in	in	ADP
ap-1682	152	8	this	this	DET
ap-1682	152	9	subspace	subspace	NOUN
ap-1682	152	10	.	.	PUNCT
ap-1682	153	1	therefore	therefore	ADV
ap-1682	153	2	,	,	PUNCT
ap-1682	153	3	the	the	DET
ap-1682	153	4	constraints	constraint	NOUN
ap-1682	153	5	are	be	AUX
ap-1682	153	6	evaluated	evaluate	VERB
ap-1682	153	7	,	,	PUNCT
ap-1682	153	8	i.e	i.e	CCONJ
ap-1682	153	9	the	the	DET
ap-1682	153	10	stresses	stress	NOUN
ap-1682	153	11	and	and	CCONJ
ap-1682	153	12	displacements	displacement	NOUN
ap-1682	153	13	are	be	AUX
ap-1682	153	14	calculated	calculate	VERB
ap-1682	153	15	.	.	PUNCT
ap-1682	154	1	(	(	PUNCT
ap-1682	154	2	a	a	X
ap-1682	154	3	)	)	PUNCT
ap-1682	154	4	if	if	SCONJ
ap-1682	154	5	the	the	DET
ap-1682	154	6	constraints	constraint	NOUN
ap-1682	154	7	are	be	AUX
ap-1682	154	8	fulfilled	fulfil	VERB
ap-1682	154	9	,	,	PUNCT
ap-1682	154	10	i.e.	i.e.	X
ap-1682	154	11	,	,	PUNCT
ap-1682	154	12	max	max	PROPN
ap-1682	154	13	|σi|	|σi|	PROPN
ap-1682	154	14	≤	≤	PROPN
ap-1682	154	15	60	60	NUM
ap-1682	154	16	ksi	ksi	NOUN
ap-1682	154	17	and	and	CCONJ
ap-1682	154	18	max	max	PROPN
ap-1682	154	19	|wj	|wj	X
ap-1682	154	20	|	|	ADV
ap-1682	154	21	≤	≤	NOUN
ap-1682	154	22	0.06	0.06	NUM
ap-1682	154	23	in	in	ADP
ap-1682	154	24	,	,	PUNCT
ap-1682	154	25	the	the	DET
ap-1682	154	26	upper	upper	ADJ
ap-1682	154	27	bound	bind	VERB
ap-1682	154	28	is	be	AUX
ap-1682	154	29	updated	update	VERB
ap-1682	154	30	to	to	ADP
ap-1682	154	31	the	the	DET
ap-1682	154	32	actual	actual	ADJ
ap-1682	154	33	objective	objective	ADJ
ap-1682	154	34	function	function	NOUN
ap-1682	154	35	value	value	NOUN
ap-1682	154	36	mmax	mmax	NOUN
ap-1682	154	37	=	=	PUNCT
ap-1682	154	38	m.	m.	NOUN
ap-1682	154	39	thus	thus	ADV
ap-1682	154	40	the	the	DET
ap-1682	154	41	upper	upper	ADJ
ap-1682	154	42	bound	bound	NOUN
ap-1682	154	43	is	be	AUX
ap-1682	154	44	pushed	push	VERB
ap-1682	154	45	down	down	ADP
ap-1682	154	46	towards	towards	ADP
ap-1682	154	47	the	the	DET
ap-1682	154	48	global	global	ADJ
ap-1682	154	49	optimum	optimum	NOUN
ap-1682	154	50	and	and	CCONJ
ap-1682	154	51	the	the	DET
ap-1682	154	52	searched	search	VERB
ap-1682	154	53	space	space	NOUN
ap-1682	154	54	is	be	AUX
ap-1682	154	55	reduced	reduce	VERB
ap-1682	154	56	.	.	PUNCT
ap-1682	155	1	the	the	DET
ap-1682	155	2	last	last	ADJ
ap-1682	155	3	variable	variable	ADJ
ap-1682	155	4	value	value	NOUN
ap-1682	155	5	is	be	AUX
ap-1682	155	6	then	then	ADV
ap-1682	155	7	increased	increase	VERB
ap-1682	155	8	by	by	ADP
ap-1682	155	9	one	one	NUM
ap-1682	155	10	.	.	PUNCT
ap-1682	156	1	if	if	SCONJ
ap-1682	156	2	this	this	DET
ap-1682	156	3	variable	variable	ADJ
ap-1682	156	4	value	value	NOUN
ap-1682	156	5	exceeds	exceed	VERB
ap-1682	156	6	its	its	PRON
ap-1682	156	7	maximum	maximum	ADJ
ap-1682	156	8	possible	possible	ADJ
ap-1682	156	9	cross	cross	ADJ
ap-1682	156	10	-	-	ADJ
ap-1682	156	11	sectional	sectional	ADJ
ap-1682	156	12	area	area	NOUN
ap-1682	156	13	value	value	NOUN
ap-1682	156	14	from	from	ADP
ap-1682	156	15	a	a	DET
ap-1682	156	16	given	give	VERB
ap-1682	156	17	set	set	NOUN
ap-1682	156	18	,	,	PUNCT
ap-1682	156	19	e.g.	e.g.	ADV
ap-1682	156	20	1	1	NUM
ap-1682	156	21	1	1	NUM
ap-1682	156	22	5	5	NUM
ap-1682	156	23	11	11	NUM
ap-1682	156	24	1	1	NUM
ap-1682	156	25	,	,	PUNCT
ap-1682	156	26	its	its	PRON
ap-1682	156	27	value	value	NOUN
ap-1682	156	28	is	be	AUX
ap-1682	156	29	set	set	VERB
ap-1682	156	30	to	to	ADP
ap-1682	156	31	the	the	DET
ap-1682	156	32	minimum	minimum	ADJ
ap-1682	156	33	possible	possible	ADJ
ap-1682	156	34	value	value	NOUN
ap-1682	156	35	,	,	PUNCT
ap-1682	156	36	and	and	CCONJ
ap-1682	156	37	the	the	DET
ap-1682	156	38	next	next	ADJ
ap-1682	156	39	-	-	PUNCT
ap-1682	156	40	to	to	ADP
ap-1682	156	41	-	-	PUNCT
ap-1682	156	42	this	this	DET
ap-1682	156	43	variable	variable	ADJ
ap-1682	156	44	value	value	NOUN
ap-1682	156	45	is	be	AUX
ap-1682	156	46	increased	increase	VERB
ap-1682	156	47	by	by	ADP
ap-1682	156	48	one	one	NUM
ap-1682	156	49	,	,	PUNCT
ap-1682	156	50	i.e.	i.e.	X
ap-1682	156	51	,	,	PUNCT
ap-1682	156	52	1	1	NUM
ap-1682	156	53	1	1	NUM
ap-1682	156	54	6	6	NUM
ap-1682	156	55	1	1	NUM
ap-1682	156	56	1	1	NUM
ap-1682	156	57	.	.	PUNCT
ap-1682	157	1	the	the	DET
ap-1682	157	2	algorithm	algorithm	NOUN
ap-1682	157	3	goes	go	VERB
ap-1682	157	4	to	to	PART
ap-1682	157	5	step	step	VERB
ap-1682	157	6	2	2	NUM
ap-1682	157	7	.	.	PUNCT
ap-1682	158	1	(	(	PUNCT
ap-1682	158	2	b	b	X
ap-1682	158	3	)	)	PUNCT
ap-1682	158	4	if	if	SCONJ
ap-1682	158	5	the	the	DET
ap-1682	158	6	constraints	constraint	NOUN
ap-1682	158	7	are	be	AUX
ap-1682	158	8	not	not	PART
ap-1682	158	9	fulfilled	fulfil	VERB
ap-1682	158	10	,	,	PUNCT
ap-1682	158	11	the	the	DET
ap-1682	158	12	value	value	NOUN
ap-1682	158	13	of	of	ADP
ap-1682	158	14	the	the	DET
ap-1682	158	15	last	last	ADJ
ap-1682	158	16	variable	variable	NOUN
ap-1682	158	17	is	be	AUX
ap-1682	158	18	increased	increase	VERB
ap-1682	158	19	by	by	ADP
ap-1682	158	20	one	one	NUM
ap-1682	158	21	.	.	PUNCT
ap-1682	159	1	the	the	DET
ap-1682	159	2	algorithm	algorithm	NOUN
ap-1682	159	3	continues	continue	VERB
ap-1682	159	4	with	with	ADP
ap-1682	159	5	step	step	NOUN
ap-1682	159	6	2	2	NUM
ap-1682	159	7	.	.	NOUN
ap-1682	159	8	5	5	NUM
ap-1682	159	9	.	.	PUNCT
ap-1682	160	1	the	the	DET
ap-1682	160	2	value	value	NOUN
ap-1682	160	3	of	of	ADP
ap-1682	160	4	the	the	DET
ap-1682	160	5	objective	objective	ADJ
ap-1682	160	6	function	function	NOUN
ap-1682	160	7	is	be	AUX
ap-1682	160	8	greater	great	ADJ
ap-1682	160	9	than	than	ADP
ap-1682	160	10	mmax	mmax	NOUN
ap-1682	160	11	.	.	PUNCT
ap-1682	161	1	the	the	DET
ap-1682	161	2	value	value	NOUN
ap-1682	161	3	of	of	ADP
ap-1682	161	4	the	the	DET
ap-1682	161	5	last	last	ADJ
ap-1682	161	6	variable	variable	NOUN
ap-1682	161	7	is	be	AUX
ap-1682	161	8	decreased	decrease	VERB
ap-1682	161	9	77	77	NUM
ap-1682	161	10	acta	acta	PROPN
ap-1682	161	11	polytechnica	polytechnica	PROPN
ap-1682	161	12	vol	vol	NOUN
ap-1682	161	13	.	.	PROPN
ap-1682	162	1	52	52	NUM
ap-1682	162	2	no	no	NOUN
ap-1682	162	3	.	.	PUNCT
ap-1682	163	1	6/2012	6/2012	NUM
ap-1682	163	2	1.41	1.41	NUM
ap-1682	163	3	%	%	NOUN
ap-1682	163	4	6.13	6.13	NUM
ap-1682	163	5	%	%	NOUN
ap-1682	163	6	92.46	92.46	NUM
ap-1682	163	7	%	%	NOUN
ap-1682	163	8	number	number	NOUN
ap-1682	163	9	of	of	ADP
ap-1682	163	10	potential	potential	ADJ
ap-1682	163	11	solutions	solution	NOUN
ap-1682	163	12	below	below	ADP
ap-1682	163	13	the	the	DET
ap-1682	163	14	lower	lower	ADV
ap-1682	163	15	bound	bind	VERB
ap-1682	163	16	(	(	PUNCT
ap-1682	163	17	step	step	NOUN
ap-1682	163	18	3	3	NUM
ap-1682	163	19	)	)	PUNCT
ap-1682	163	20	number	number	NOUN
ap-1682	163	21	of	of	ADP
ap-1682	163	22	potential	potential	ADJ
ap-1682	163	23	solutions	solution	NOUN
ap-1682	163	24	between	between	ADP
ap-1682	163	25	the	the	DET
ap-1682	163	26	lower	lower	ADV
ap-1682	163	27	bound	bind	VERB
ap-1682	163	28	and	and	CCONJ
ap-1682	163	29	the	the	DET
ap-1682	163	30	upper	upper	ADJ
ap-1682	163	31	bound	bound	ADJ
ap-1682	163	32	(	(	PUNCT
ap-1682	163	33	step	step	NOUN
ap-1682	163	34	4	4	NUM
ap-1682	163	35	)	)	PUNCT
ap-1682	163	36	number	number	NOUN
ap-1682	163	37	of	of	ADP
ap-1682	163	38	potential	potential	ADJ
ap-1682	163	39	solutions	solution	NOUN
ap-1682	163	40	above	above	ADP
ap-1682	163	41	the	the	DET
ap-1682	163	42	upper	upper	ADJ
ap-1682	163	43	bound	bound	ADJ
ap-1682	163	44	(	(	PUNCT
ap-1682	163	45	step	step	NOUN
ap-1682	163	46	5	5	NUM
ap-1682	163	47	)	)	PUNCT
ap-1682	163	48	figure	figure	NOUN
ap-1682	163	49	3	3	NUM
ap-1682	163	50	:	:	PUNCT
ap-1682	163	51	a	a	DET
ap-1682	163	52	pie	pie	NOUN
ap-1682	163	53	chart	chart	NOUN
ap-1682	163	54	of	of	ADP
ap-1682	163	55	a	a	DET
ap-1682	163	56	distribution	distribution	NOUN
ap-1682	163	57	of	of	ADP
ap-1682	163	58	the	the	DET
ap-1682	163	59	5	5	NUM
ap-1682	163	60	-	-	PUNCT
ap-1682	163	61	bar	bar	NOUN
ap-1682	163	62	truss	truss	NOUN
ap-1682	163	63	problem	problem	NOUN
ap-1682	163	64	solutions	solution	NOUN
ap-1682	163	65	solved	solve	VERB
ap-1682	163	66	by	by	ADP
ap-1682	163	67	the	the	DET
ap-1682	163	68	branch	branch	NOUN
ap-1682	163	69	and	and	CCONJ
ap-1682	163	70	bound	bind	VERB
ap-1682	163	71	method	method	NOUN
ap-1682	163	72	.	.	PUNCT
ap-1682	164	1	to	to	ADP
ap-1682	164	2	its	its	PRON
ap-1682	164	3	minimum	minimum	NOUN
ap-1682	164	4	,	,	PUNCT
ap-1682	164	5	the	the	DET
ap-1682	164	6	next	next	ADJ
ap-1682	164	7	-	-	PUNCT
ap-1682	164	8	to	to	ADP
ap-1682	164	9	-	-	PUNCT
ap-1682	164	10	last	last	ADJ
ap-1682	164	11	variable	variable	ADJ
ap-1682	164	12	value	value	NOUN
ap-1682	164	13	is	be	AUX
ap-1682	164	14	increased	increase	VERB
ap-1682	164	15	by	by	ADP
ap-1682	164	16	one	one	NUM
ap-1682	164	17	and	and	CCONJ
ap-1682	164	18	the	the	DET
ap-1682	164	19	objective	objective	ADJ
ap-1682	164	20	function	function	NOUN
ap-1682	164	21	value	value	NOUN
ap-1682	164	22	is	be	AUX
ap-1682	164	23	calculated	calculate	VERB
ap-1682	164	24	.	.	PUNCT
ap-1682	165	1	if	if	SCONJ
ap-1682	165	2	the	the	DET
ap-1682	165	3	variable	variable	NOUN
ap-1682	165	4	exceeds	exceed	VERB
ap-1682	165	5	its	its	PRON
ap-1682	165	6	maximum	maximum	ADJ
ap-1682	165	7	possible	possible	ADJ
ap-1682	165	8	value	value	NOUN
ap-1682	165	9	from	from	ADP
ap-1682	165	10	the	the	DET
ap-1682	165	11	given	give	VERB
ap-1682	165	12	set	set	NOUN
ap-1682	165	13	,	,	PUNCT
ap-1682	165	14	the	the	DET
ap-1682	165	15	algorithm	algorithm	NOUN
ap-1682	165	16	acts	act	VERB
ap-1682	165	17	as	as	ADP
ap-1682	165	18	in	in	ADP
ap-1682	165	19	step	step	NOUN
ap-1682	165	20	4a	4a	NOUN
ap-1682	165	21	.	.	PUNCT
ap-1682	166	1	(	(	PUNCT
ap-1682	166	2	a	a	X
ap-1682	166	3	)	)	PUNCT
ap-1682	166	4	if	if	SCONJ
ap-1682	166	5	the	the	DET
ap-1682	166	6	value	value	NOUN
ap-1682	166	7	of	of	ADP
ap-1682	166	8	objective	objective	ADJ
ap-1682	166	9	function	function	NOUN
ap-1682	166	10	m	m	VERB
ap-1682	166	11	is	be	AUX
ap-1682	166	12	lower	low	ADJ
ap-1682	166	13	than	than	ADP
ap-1682	166	14	mmax	mmax	NOUN
ap-1682	166	15	,	,	PUNCT
ap-1682	166	16	the	the	DET
ap-1682	166	17	algorithm	algorithm	NOUN
ap-1682	166	18	goes	go	VERB
ap-1682	166	19	to	to	PART
ap-1682	166	20	step	step	VERB
ap-1682	166	21	2	2	NUM
ap-1682	166	22	.	.	PUNCT
ap-1682	167	1	(	(	PUNCT
ap-1682	167	2	b	b	X
ap-1682	167	3	)	)	PUNCT
ap-1682	167	4	if	if	SCONJ
ap-1682	167	5	objective	objective	ADJ
ap-1682	167	6	function	function	NOUN
ap-1682	167	7	value	value	NOUN
ap-1682	167	8	m	m	VERB
ap-1682	167	9	is	be	AUX
ap-1682	167	10	greater	great	ADJ
ap-1682	167	11	than	than	ADP
ap-1682	167	12	mmax	mmax	NOUN
ap-1682	167	13	,	,	PUNCT
ap-1682	167	14	the	the	DET
ap-1682	167	15	value	value	NOUN
ap-1682	167	16	of	of	ADP
ap-1682	167	17	the	the	DET
ap-1682	167	18	third	third	ADJ
ap-1682	167	19	variable	variable	NOUN
ap-1682	167	20	from	from	ADP
ap-1682	167	21	the	the	DET
ap-1682	167	22	end	end	NOUN
ap-1682	167	23	increases	increase	NOUN
ap-1682	167	24	by	by	ADP
ap-1682	167	25	one	one	NUM
ap-1682	167	26	and	and	CCONJ
ap-1682	167	27	the	the	DET
ap-1682	167	28	value	value	NOUN
ap-1682	167	29	of	of	ADP
ap-1682	167	30	the	the	DET
ap-1682	167	31	next	next	ADJ
ap-1682	167	32	-	-	PUNCT
ap-1682	167	33	to	to	ADP
ap-1682	167	34	-	-	PUNCT
ap-1682	167	35	last	last	ADJ
ap-1682	167	36	variable	variable	NOUN
ap-1682	167	37	is	be	AUX
ap-1682	167	38	set	set	VERB
ap-1682	167	39	to	to	ADP
ap-1682	167	40	its	its	PRON
ap-1682	167	41	minimum	minimum	NOUN
ap-1682	167	42	.	.	PUNCT
ap-1682	168	1	the	the	DET
ap-1682	168	2	algorithm	algorithm	NOUN
ap-1682	168	3	continues	continue	VERB
ap-1682	168	4	in	in	ADP
ap-1682	168	5	this	this	DET
ap-1682	168	6	way	way	NOUN
ap-1682	168	7	until	until	SCONJ
ap-1682	168	8	the	the	DET
ap-1682	168	9	objective	objective	ADJ
ap-1682	168	10	function	function	NOUN
ap-1682	168	11	value	value	NOUN
ap-1682	168	12	is	be	AUX
ap-1682	168	13	less	less	ADJ
ap-1682	168	14	than	than	ADP
ap-1682	168	15	mmax	mmax	ADJ
ap-1682	168	16	.	.	PUNCT
ap-1682	169	1	if	if	SCONJ
ap-1682	169	2	there	there	PRON
ap-1682	169	3	is	be	VERB
ap-1682	169	4	no	no	DET
ap-1682	169	5	such	such	ADJ
ap-1682	169	6	combination	combination	NOUN
ap-1682	169	7	of	of	ADP
ap-1682	169	8	cross	cross	ADJ
ap-1682	169	9	-	-	ADJ
ap-1682	169	10	sectional	sectional	ADJ
ap-1682	169	11	areas	area	NOUN
ap-1682	169	12	,	,	PUNCT
ap-1682	169	13	the	the	DET
ap-1682	169	14	algorithm	algorithm	NOUN
ap-1682	169	15	is	be	AUX
ap-1682	169	16	terminated	terminate	VERB
ap-1682	169	17	.	.	PUNCT
ap-1682	170	1	6	6	X
ap-1682	170	2	.	.	X
ap-1682	170	3	if	if	SCONJ
ap-1682	170	4	all	all	DET
ap-1682	170	5	variable	variable	ADJ
ap-1682	170	6	values	value	NOUN
ap-1682	170	7	are	be	AUX
ap-1682	170	8	set	set	VERB
ap-1682	170	9	to	to	ADP
ap-1682	170	10	their	their	PRON
ap-1682	170	11	maxima	maxima	NOUN
ap-1682	170	12	,	,	PUNCT
ap-1682	170	13	the	the	DET
ap-1682	170	14	algorithm	algorithm	NOUN
ap-1682	170	15	ends	end	VERB
ap-1682	170	16	.	.	PUNCT
ap-1682	171	1	fig	fig	NOUN
ap-1682	171	2	.	.	PUNCT
ap-1682	172	1	3	3	NUM
ap-1682	172	2	shows	show	VERB
ap-1682	172	3	the	the	DET
ap-1682	172	4	distribution	distribution	NOUN
ap-1682	172	5	of	of	ADP
ap-1682	172	6	5	5	NUM
ap-1682	172	7	-	-	PUNCT
ap-1682	172	8	bar	bar	NOUN
ap-1682	172	9	truss	truss	NOUN
ap-1682	172	10	potential	potential	ADJ
ap-1682	172	11	solutions	solution	NOUN
ap-1682	172	12	.	.	PUNCT
ap-1682	173	1	the	the	DET
ap-1682	173	2	dark	dark	ADJ
ap-1682	173	3	grey	grey	PROPN
ap-1682	173	4	part	part	NOUN
ap-1682	173	5	shows	show	VERB
ap-1682	173	6	the	the	DET
ap-1682	173	7	number	number	NOUN
ap-1682	173	8	of	of	ADP
ap-1682	173	9	potential	potential	ADJ
ap-1682	173	10	solutions	solution	NOUN
ap-1682	173	11	below	below	ADP
ap-1682	173	12	the	the	DET
ap-1682	173	13	lower	lower	ADV
ap-1682	173	14	bound	bind	VERB
ap-1682	173	15	,	,	PUNCT
ap-1682	173	16	where	where	SCONJ
ap-1682	173	17	only	only	ADV
ap-1682	173	18	the	the	DET
ap-1682	173	19	objective	objective	ADJ
ap-1682	173	20	function	function	NOUN
ap-1682	173	21	values	value	NOUN
ap-1682	173	22	are	be	AUX
ap-1682	173	23	calculated	calculate	VERB
ap-1682	173	24	,	,	PUNCT
ap-1682	173	25	i.e.	i.e.	X
ap-1682	173	26	,	,	PUNCT
ap-1682	173	27	step	step	NOUN
ap-1682	173	28	3	3	NUM
ap-1682	173	29	of	of	ADP
ap-1682	173	30	the	the	DET
ap-1682	173	31	algorithm	algorithm	NOUN
ap-1682	173	32	.	.	PUNCT
ap-1682	174	1	the	the	DET
ap-1682	174	2	grey	grey	PROPN
ap-1682	174	3	part	part	NOUN
ap-1682	174	4	shows	show	VERB
ap-1682	174	5	the	the	DET
ap-1682	174	6	number	number	NOUN
ap-1682	174	7	of	of	ADP
ap-1682	174	8	potential	potential	ADJ
ap-1682	174	9	solutions	solution	NOUN
ap-1682	174	10	between	between	ADP
ap-1682	174	11	the	the	DET
ap-1682	174	12	lower	low	ADJ
ap-1682	174	13	and	and	CCONJ
ap-1682	174	14	the	the	DET
ap-1682	174	15	upper	upper	ADJ
ap-1682	174	16	bound	bind	VERB
ap-1682	174	17	,	,	PUNCT
ap-1682	174	18	where	where	SCONJ
ap-1682	174	19	the	the	DET
ap-1682	174	20	values	value	NOUN
ap-1682	174	21	of	of	ADP
ap-1682	174	22	the	the	DET
ap-1682	174	23	objective	objective	ADJ
ap-1682	174	24	function	function	NOUN
ap-1682	174	25	and	and	CCONJ
ap-1682	174	26	also	also	ADV
ap-1682	174	27	the	the	DET
ap-1682	174	28	constraints	constraint	NOUN
ap-1682	174	29	are	be	AUX
ap-1682	174	30	calculated	calculate	VERB
ap-1682	174	31	(	(	PUNCT
ap-1682	174	32	step	step	NOUN
ap-1682	174	33	4	4	NUM
ap-1682	174	34	)	)	PUNCT
ap-1682	174	35	.	.	PUNCT
ap-1682	175	1	the	the	DET
ap-1682	175	2	global	global	ADJ
ap-1682	175	3	optimum	optimum	NOUN
ap-1682	175	4	is	be	AUX
ap-1682	175	5	included	include	VERB
ap-1682	175	6	in	in	ADP
ap-1682	175	7	this	this	DET
ap-1682	175	8	subspace	subspace	NOUN
ap-1682	175	9	.	.	PUNCT
ap-1682	176	1	the	the	DET
ap-1682	176	2	light	light	ADJ
ap-1682	176	3	grey	grey	ADJ
ap-1682	176	4	part	part	NOUN
ap-1682	176	5	represents	represent	VERB
ap-1682	176	6	the	the	DET
ap-1682	176	7	number	number	NOUN
ap-1682	176	8	of	of	ADP
ap-1682	176	9	potential	potential	ADJ
ap-1682	176	10	solutions	solution	NOUN
ap-1682	176	11	above	above	ADP
ap-1682	176	12	the	the	DET
ap-1682	176	13	upper	upper	ADJ
ap-1682	176	14	bound	bind	VERB
ap-1682	176	15	,	,	PUNCT
ap-1682	176	16	where	where	SCONJ
ap-1682	176	17	only	only	ADV
ap-1682	176	18	the	the	DET
ap-1682	176	19	objective	objective	ADJ
ap-1682	176	20	function	function	NOUN
ap-1682	176	21	values	value	NOUN
ap-1682	176	22	are	be	AUX
ap-1682	176	23	calculated	calculate	VERB
ap-1682	176	24	(	(	PUNCT
ap-1682	176	25	step	step	NOUN
ap-1682	176	26	5	5	NUM
ap-1682	176	27	)	)	PUNCT
ap-1682	176	28	.	.	PUNCT
ap-1682	177	1	it	it	PRON
ap-1682	177	2	is	be	AUX
ap-1682	177	3	obvious	obvious	ADJ
ap-1682	177	4	that	that	SCONJ
ap-1682	177	5	there	there	PRON
ap-1682	177	6	is	be	VERB
ap-1682	177	7	no	no	DET
ap-1682	177	8	need	need	NOUN
ap-1682	177	9	to	to	PART
ap-1682	177	10	compute	compute	VERB
ap-1682	177	11	constraints	constraint	NOUN
ap-1682	177	12	for	for	ADP
ap-1682	177	13	more	more	ADJ
ap-1682	177	14	than	than	ADP
ap-1682	177	15	90	90	NUM
ap-1682	177	16	%	%	NOUN
ap-1682	177	17	of	of	ADP
ap-1682	177	18	potential	potential	ADJ
ap-1682	177	19	solutions	solution	NOUN
ap-1682	177	20	.	.	PUNCT
ap-1682	178	1	since	since	SCONJ
ap-1682	178	2	the	the	DET
ap-1682	178	3	evaluation	evaluation	NOUN
ap-1682	178	4	of	of	ADP
ap-1682	178	5	constraints	constraint	NOUN
ap-1682	178	6	is	be	AUX
ap-1682	178	7	very	very	ADV
ap-1682	178	8	computationally	computationally	ADV
ap-1682	178	9	demanding	demanding	ADJ
ap-1682	178	10	,	,	PUNCT
ap-1682	178	11	this	this	PRON
ap-1682	178	12	results	result	VERB
ap-1682	178	13	in	in	ADP
ap-1682	178	14	significant	significant	ADJ
ap-1682	178	15	time	time	NOUN
ap-1682	178	16	savings	saving	NOUN
ap-1682	178	17	.	.	PUNCT
ap-1682	179	1	the	the	DET
ap-1682	179	2	reason	reason	NOUN
ap-1682	179	3	for	for	ADP
ap-1682	179	4	the	the	DET
ap-1682	179	5	bigger	big	ADJ
ap-1682	179	6	number	number	NOUN
ap-1682	179	7	of	of	ADP
ap-1682	179	8	potential	potential	ADJ
ap-1682	179	9	solutions	solution	NOUN
ap-1682	179	10	above	above	ADP
ap-1682	179	11	the	the	DET
ap-1682	179	12	upper	upper	ADJ
ap-1682	179	13	1	1	NUM
ap-1682	179	14	2	2	NUM
ap-1682	179	15	3	3	NUM
ap-1682	179	16	5	5	NUM
ap-1682	179	17	8	8	NUM
ap-1682	179	18	6	6	NUM
ap-1682	179	19	7	7	NUM
ap-1682	179	20	10	10	NUM
ap-1682	179	21	9	9	NUM
ap-1682	179	22	75	75	NUM
ap-1682	179	23	z	z	NOUN
ap-1682	179	24	10	10	NUM
ap-1682	179	25	0	0	NUM
ap-1682	179	26	10	10	NUM
ap-1682	179	27	0	0	NUM
ap-1682	179	28	x	x	SYM
ap-1682	179	29	y	y	PROPN
ap-1682	179	30	200200	200200	NUM
ap-1682	179	31	[	[	X
ap-1682	179	32	in	in	ADP
ap-1682	179	33	]	]	PUNCT
ap-1682	179	34	4	4	NUM
ap-1682	179	35	figure	figure	NOUN
ap-1682	179	36	4	4	NUM
ap-1682	179	37	:	:	PUNCT
ap-1682	179	38	a	a	DET
ap-1682	179	39	25	25	NUM
ap-1682	179	40	-	-	PUNCT
ap-1682	179	41	bar	bar	NOUN
ap-1682	179	42	truss	truss	NOUN
ap-1682	179	43	.	.	PUNCT
ap-1682	180	1	bound	bind	VERB
ap-1682	180	2	is	be	AUX
ap-1682	180	3	that	that	SCONJ
ap-1682	180	4	the	the	DET
ap-1682	180	5	optimum	optimum	NOUN
ap-1682	180	6	is	be	AUX
ap-1682	180	7	placed	place	VERB
ap-1682	180	8	relatively	relatively	ADV
ap-1682	180	9	close	close	ADJ
ap-1682	180	10	to	to	ADP
ap-1682	180	11	the	the	DET
ap-1682	180	12	lower	lower	ADV
ap-1682	180	13	bound	bind	VERB
ap-1682	180	14	in	in	ADP
ap-1682	180	15	the	the	DET
ap-1682	180	16	searched	search	VERB
ap-1682	180	17	subspace	subspace	NOUN
ap-1682	180	18	.	.	PUNCT
ap-1682	181	1	tab	tab	NOUN
ap-1682	181	2	.	.	PUNCT
ap-1682	182	1	1	1	NUM
ap-1682	182	2	presents	present	NOUN
ap-1682	182	3	results	result	NOUN
ap-1682	182	4	for	for	ADP
ap-1682	182	5	the	the	DET
ap-1682	182	6	continuous	continuous	ADJ
ap-1682	182	7	optimization	optimization	NOUN
ap-1682	182	8	problem	problem	NOUN
ap-1682	182	9	along	along	ADP
ap-1682	182	10	with	with	ADP
ap-1682	182	11	results	result	NOUN
ap-1682	182	12	for	for	ADP
ap-1682	182	13	the	the	DET
ap-1682	182	14	discrete	discrete	ADJ
ap-1682	182	15	problem	problem	NOUN
ap-1682	182	16	solved	solve	VERB
ap-1682	182	17	by	by	ADP
ap-1682	182	18	the	the	DET
ap-1682	182	19	enumeration	enumeration	NOUN
ap-1682	182	20	and	and	CCONJ
ap-1682	182	21	the	the	DET
ap-1682	182	22	method	method	NOUN
ap-1682	182	23	based	base	VERB
ap-1682	182	24	on	on	ADP
ap-1682	182	25	branch	branch	NOUN
ap-1682	182	26	and	and	CCONJ
ap-1682	182	27	bound	bind	VERB
ap-1682	182	28	principles	principle	NOUN
ap-1682	182	29	.	.	PUNCT
ap-1682	183	1	since	since	SCONJ
ap-1682	183	2	the	the	DET
ap-1682	183	3	enumeration	enumeration	NOUN
ap-1682	183	4	calculates	calculate	VERB
ap-1682	183	5	the	the	DET
ap-1682	183	6	values	value	NOUN
ap-1682	183	7	of	of	ADP
ap-1682	183	8	the	the	DET
ap-1682	183	9	objective	objective	ADJ
ap-1682	183	10	function	function	NOUN
ap-1682	183	11	as	as	ADV
ap-1682	183	12	well	well	ADV
ap-1682	183	13	as	as	ADP
ap-1682	183	14	constraints	constraint	NOUN
ap-1682	183	15	for	for	ADP
ap-1682	183	16	all	all	DET
ap-1682	183	17	potential	potential	ADJ
ap-1682	183	18	solutions	solution	NOUN
ap-1682	183	19	,	,	PUNCT
ap-1682	183	20	it	it	PRON
ap-1682	183	21	is	be	AUX
ap-1682	183	22	not	not	PART
ap-1682	183	23	possible	possible	ADJ
ap-1682	183	24	to	to	PART
ap-1682	183	25	omit	omit	VERB
ap-1682	183	26	the	the	DET
ap-1682	183	27	global	global	ADJ
ap-1682	183	28	optimum	optimum	NOUN
ap-1682	183	29	.	.	PUNCT
ap-1682	184	1	the	the	DET
ap-1682	184	2	results	result	NOUN
ap-1682	184	3	obtained	obtain	VERB
ap-1682	184	4	by	by	ADP
ap-1682	184	5	both	both	DET
ap-1682	184	6	presented	present	VERB
ap-1682	184	7	methods	method	NOUN
ap-1682	184	8	are	be	AUX
ap-1682	184	9	identical	identical	ADJ
ap-1682	184	10	and	and	CCONJ
ap-1682	184	11	this	this	DET
ap-1682	184	12	comparison	comparison	NOUN
ap-1682	184	13	serves	serve	VERB
ap-1682	184	14	as	as	ADP
ap-1682	184	15	the	the	DET
ap-1682	184	16	verification	verification	NOUN
ap-1682	184	17	of	of	ADP
ap-1682	184	18	the	the	DET
ap-1682	184	19	branch	branch	NOUN
ap-1682	184	20	and	and	CCONJ
ap-1682	184	21	bound	bind	VERB
ap-1682	184	22	method	method	NOUN
ap-1682	184	23	.	.	PUNCT
ap-1682	185	1	5.2	5.2	NUM
ap-1682	185	2	25	25	NUM
ap-1682	185	3	-	-	PUNCT
ap-1682	185	4	bar	bar	NOUN
ap-1682	185	5	truss	truss	NOUN
ap-1682	185	6	the	the	DET
ap-1682	185	7	25	25	NUM
ap-1682	185	8	-	-	PUNCT
ap-1682	185	9	bar	bar	NOUN
ap-1682	185	10	truss	truss	NOUN
ap-1682	185	11	is	be	AUX
ap-1682	185	12	one	one	NUM
ap-1682	185	13	of	of	ADP
ap-1682	185	14	the	the	DET
ap-1682	185	15	most	most	ADV
ap-1682	185	16	widely	widely	ADV
ap-1682	185	17	-	-	PUNCT
ap-1682	185	18	used	use	VERB
ap-1682	185	19	benchmarks	benchmark	NOUN
ap-1682	185	20	for	for	ADP
ap-1682	185	21	size	size	NOUN
ap-1682	185	22	optimization	optimization	NOUN
ap-1682	185	23	.	.	PUNCT
ap-1682	186	1	it	it	PRON
ap-1682	186	2	was	be	AUX
ap-1682	186	3	introduced	introduce	VERB
ap-1682	186	4	by	by	ADP
ap-1682	186	5	fox	fox	PROPN
ap-1682	186	6	and	and	CCONJ
ap-1682	186	7	schmit	schmit	PROPN
ap-1682	187	1	[	[	X
ap-1682	187	2	10	10	NUM
ap-1682	187	3	]	]	PUNCT
ap-1682	187	4	in	in	ADP
ap-1682	187	5	1966	1966	NUM
ap-1682	187	6	.	.	PUNCT
ap-1682	188	1	the	the	DET
ap-1682	188	2	structure	structure	NOUN
ap-1682	188	3	has	have	VERB
ap-1682	188	4	ten	ten	NUM
ap-1682	188	5	nodes	node	NOUN
ap-1682	188	6	and	and	CCONJ
ap-1682	188	7	four	four	NUM
ap-1682	188	8	supports	support	NOUN
ap-1682	188	9	(	(	PUNCT
ap-1682	188	10	at	at	ADP
ap-1682	188	11	nodes	node	NOUN
ap-1682	188	12	7–10	7–10	PROPN
ap-1682	188	13	)	)	PUNCT
ap-1682	188	14	,	,	PUNCT
ap-1682	188	15	see	see	VERB
ap-1682	188	16	fig	fig	NOUN
ap-1682	188	17	.	.	PUNCT
ap-1682	189	1	4	4	NUM
ap-1682	189	2	;	;	PUNCT
ap-1682	189	3	therefore	therefore	ADV
ap-1682	189	4	there	there	PRON
ap-1682	189	5	are	be	VERB
ap-1682	189	6	18	18	NUM
ap-1682	189	7	free	free	ADJ
ap-1682	189	8	displacements	displacement	NOUN
ap-1682	189	9	.	.	PUNCT
ap-1682	190	1	the	the	DET
ap-1682	190	2	structure	structure	NOUN
ap-1682	190	3	is	be	AUX
ap-1682	190	4	symmetric	symmetric	ADJ
ap-1682	190	5	so	so	SCONJ
ap-1682	190	6	some	some	DET
ap-1682	190	7	elements	element	NOUN
ap-1682	190	8	were	be	AUX
ap-1682	190	9	gathered	gather	VERB
ap-1682	190	10	to	to	ADP
ap-1682	190	11	eight	eight	NUM
ap-1682	190	12	groups	group	NOUN
ap-1682	190	13	,	,	PUNCT
ap-1682	190	14	listed	list	VERB
ap-1682	190	15	in	in	ADP
ap-1682	190	16	tab	tab	NOUN
ap-1682	190	17	.	.	PUNCT
ap-1682	191	1	2	2	X
ap-1682	191	2	.	.	X
ap-1682	191	3	the	the	DET
ap-1682	191	4	truss	truss	NOUN
ap-1682	191	5	is	be	AUX
ap-1682	191	6	made	make	VERB
ap-1682	191	7	of	of	ADP
ap-1682	191	8	aluminium	aluminium	NOUN
ap-1682	191	9	material	material	NOUN
ap-1682	191	10	,	,	PUNCT
ap-1682	191	11	with	with	ADP
ap-1682	191	12	density	density	NOUN
ap-1682	191	13	equal	equal	ADJ
ap-1682	191	14	to	to	ADP
ap-1682	191	15	0.1	0.1	NUM
ap-1682	191	16	lb	lb	NUM
ap-1682	191	17	/	/	SYM
ap-1682	191	18	in3	in3	NOUN
ap-1682	191	19	and	and	CCONJ
ap-1682	191	20	with	with	ADP
ap-1682	191	21	the	the	DET
ap-1682	191	22	young	young	PROPN
ap-1682	191	23	’s	’s	PART
ap-1682	191	24	modulus	modulus	NOUN
ap-1682	191	25	equal	equal	ADJ
ap-1682	191	26	to	to	ADP
ap-1682	191	27	104	104	NUM
ap-1682	191	28	ksi	ksi	NOUN
ap-1682	191	29	.	.	PUNCT
ap-1682	192	1	the	the	DET
ap-1682	192	2	loading	loading	NOUN
ap-1682	192	3	is	be	AUX
ap-1682	192	4	defined	define	VERB
ap-1682	192	5	in	in	ADP
ap-1682	192	6	tab	tab	NOUN
ap-1682	192	7	.	.	PUNCT
ap-1682	193	1	3	3	X
ap-1682	193	2	.	.	X
ap-1682	193	3	all	all	DET
ap-1682	193	4	cross	cross	ADJ
ap-1682	193	5	-	-	ADJ
ap-1682	193	6	sectional	sectional	ADJ
ap-1682	193	7	areas	area	NOUN
ap-1682	193	8	are	be	AUX
ap-1682	193	9	chosen	choose	VERB
ap-1682	193	10	from	from	ADP
ap-1682	193	11	the	the	DET
ap-1682	193	12	given	give	VERB
ap-1682	193	13	set	set	NOUN
ap-1682	193	14	:	:	PUNCT
ap-1682	193	15	0.1	0.1	NUM
ap-1682	193	16	,	,	PUNCT
ap-1682	193	17	0.2	0.2	NUM
ap-1682	193	18	,	,	PUNCT
ap-1682	193	19	0.3	0.3	NUM
ap-1682	193	20	,	,	PUNCT
ap-1682	193	21	0.4	0.4	NUM
ap-1682	193	22	,	,	PUNCT
ap-1682	193	23	0.5	0.5	NUM
ap-1682	193	24	,	,	PUNCT
ap-1682	193	25	0.6	0.6	NUM
ap-1682	193	26	,	,	PUNCT
ap-1682	193	27	0.7	0.7	NUM
ap-1682	193	28	,	,	PUNCT
ap-1682	193	29	0.8	0.8	NUM
ap-1682	193	30	,	,	PUNCT
ap-1682	193	31	0.9	0.9	NUM
ap-1682	193	32	,	,	PUNCT
ap-1682	193	33	1.0	1.0	NUM
ap-1682	193	34	,	,	PUNCT
ap-1682	193	35	1.1	1.1	NUM
ap-1682	193	36	,	,	PUNCT
ap-1682	193	37	1.2	1.2	NUM
ap-1682	193	38	,	,	PUNCT
ap-1682	193	39	1.3	1.3	NUM
ap-1682	193	40	,	,	PUNCT
ap-1682	193	41	1.4	1.4	NUM
ap-1682	193	42	,	,	PUNCT
ap-1682	193	43	1.5	1.5	NUM
ap-1682	193	44	,	,	PUNCT
ap-1682	193	45	1.6	1.6	NUM
ap-1682	193	46	,	,	PUNCT
ap-1682	193	47	1.7	1.7	NUM
ap-1682	193	48	,	,	PUNCT
ap-1682	193	49	1.8	1.8	NUM
ap-1682	193	50	,	,	PUNCT
ap-1682	193	51	1.9	1.9	NUM
ap-1682	193	52	,	,	PUNCT
ap-1682	193	53	2.0	2.0	NUM
ap-1682	193	54	,	,	PUNCT
ap-1682	193	55	2.1	2.1	NUM
ap-1682	193	56	,	,	PUNCT
ap-1682	193	57	2.2	2.2	NUM
ap-1682	193	58	,	,	PUNCT
ap-1682	193	59	2.3	2.3	NUM
ap-1682	193	60	,	,	PUNCT
ap-1682	193	61	2.4	2.4	NUM
ap-1682	193	62	,	,	PUNCT
ap-1682	193	63	2.5	2.5	NUM
ap-1682	193	64	,	,	PUNCT
ap-1682	193	65	2.6	2.6	NUM
ap-1682	193	66	,	,	PUNCT
ap-1682	193	67	2.8	2.8	NUM
ap-1682	193	68	,	,	PUNCT
ap-1682	193	69	3.0	3.0	NUM
ap-1682	193	70	,	,	PUNCT
ap-1682	193	71	3.2	3.2	NUM
ap-1682	193	72	and	and	CCONJ
ap-1682	193	73	3.4	3.4	NUM
ap-1682	193	74	in2	in2	NOUN
ap-1682	193	75	,	,	PUNCT
ap-1682	193	76	see	see	VERB
ap-1682	193	77	[	[	X
ap-1682	193	78	11	11	NUM
ap-1682	193	79	]	]	PUNCT
ap-1682	193	80	.	.	PUNCT
ap-1682	194	1	the	the	DET
ap-1682	194	2	continuous	continuous	ADJ
ap-1682	194	3	variables	variable	NOUN
ap-1682	194	4	range	range	VERB
ap-1682	194	5	from	from	ADP
ap-1682	194	6	0.1	0.1	NUM
ap-1682	194	7	in2	in2	PROPN
ap-1682	194	8	to	to	ADP
ap-1682	194	9	3.4	3.4	NUM
ap-1682	194	10	in2	in2	PROPN
ap-1682	194	11	.	.	PUNCT
ap-1682	195	1	the	the	DET
ap-1682	195	2	allowable	allowable	ADJ
ap-1682	195	3	stress	stress	NOUN
ap-1682	195	4	is	be	AUX
ap-1682	195	5	set	set	VERB
ap-1682	195	6	to	to	ADP
ap-1682	195	7	±40	±40	ADJ
ap-1682	195	8	ksi	ksi	NOUN
ap-1682	195	9	in	in	ADP
ap-1682	195	10	all	all	DET
ap-1682	195	11	truss	truss	NOUN
ap-1682	195	12	bars	bar	NOUN
ap-1682	195	13	and	and	CCONJ
ap-1682	195	14	the	the	DET
ap-1682	195	15	maximum	maximum	ADJ
ap-1682	195	16	allowable	allowable	ADJ
ap-1682	195	17	displacement	displacement	NOUN
ap-1682	195	18	is	be	AUX
ap-1682	195	19	±0.35	±0.35	PROPN
ap-1682	195	20	in	in	ADP
ap-1682	195	21	at	at	ADP
ap-1682	195	22	all	all	DET
ap-1682	195	23	nodes	node	NOUN
ap-1682	195	24	along	along	ADP
ap-1682	195	25	the	the	DET
ap-1682	195	26	x	x	NOUN
ap-1682	195	27	,	,	PUNCT
ap-1682	195	28	y	y	PROPN
ap-1682	195	29	and	and	CCONJ
ap-1682	195	30	z	z	NOUN
ap-1682	195	31	directions	direction	NOUN
ap-1682	195	32	.	.	PUNCT
ap-1682	196	1	the	the	DET
ap-1682	196	2	results	result	NOUN
ap-1682	196	3	for	for	ADP
ap-1682	196	4	the	the	DET
ap-1682	196	5	continuous	continuous	ADJ
ap-1682	196	6	case	case	NOUN
ap-1682	196	7	are	be	AUX
ap-1682	196	8	shown	show	VERB
ap-1682	196	9	in	in	ADP
ap-1682	196	10	tab	tab	NOUN
ap-1682	196	11	.	.	PUNCT
ap-1682	197	1	4	4	NUM
ap-1682	198	1	and	and	CCONJ
ap-1682	198	2	they	they	PRON
ap-1682	198	3	are	be	AUX
ap-1682	198	4	compared	compare	VERB
ap-1682	198	5	with	with	ADP
ap-1682	198	6	the	the	DET
ap-1682	198	7	results	result	NOUN
ap-1682	198	8	published	publish	VERB
ap-1682	198	9	in	in	ADP
ap-1682	198	10	the	the	DET
ap-1682	198	11	available	available	ADJ
ap-1682	198	12	literature	literature	NOUN
ap-1682	198	13	.	.	PUNCT
ap-1682	199	1	the	the	DET
ap-1682	199	2	discrete	discrete	ADJ
ap-1682	199	3	case	case	NOUN
ap-1682	199	4	can	can	AUX
ap-1682	199	5	not	not	PART
ap-1682	199	6	be	be	AUX
ap-1682	199	7	enumerated	enumerate	VERB
ap-1682	199	8	within	within	ADP
ap-1682	199	9	a	a	DET
ap-1682	199	10	reasonable	reasonable	ADJ
ap-1682	199	11	time	time	NOUN
ap-1682	199	12	because	because	SCONJ
ap-1682	199	13	the	the	DET
ap-1682	199	14	number	number	NOUN
ap-1682	199	15	of	of	ADP
ap-1682	199	16	potential	potential	ADJ
ap-1682	199	17	solutions	solution	NOUN
ap-1682	199	18	is	be	AUX
ap-1682	199	19	nk	nk	PROPN
ap-1682	199	20	=	=	PROPN
ap-1682	199	21	308	308	NUM
ap-1682	199	22	=	=	SYM
ap-1682	199	23	6.561	6.561	NUM
ap-1682	199	24	·	·	SYM
ap-1682	199	25	1011	1011	NUM
ap-1682	199	26	,	,	PUNCT
ap-1682	199	27	where	where	SCONJ
ap-1682	199	28	k	k	PROPN
ap-1682	199	29	is	be	AUX
ap-1682	199	30	the	the	DET
ap-1682	199	31	number	number	NOUN
ap-1682	199	32	of	of	ADP
ap-1682	199	33	element	element	NOUN
ap-1682	199	34	groups	group	NOUN
ap-1682	199	35	.	.	PUNCT
ap-1682	200	1	for	for	ADP
ap-1682	200	2	the	the	DET
ap-1682	200	3	discrete	discrete	ADJ
ap-1682	200	4	case	case	NOUN
ap-1682	200	5	,	,	PUNCT
ap-1682	200	6	the	the	DET
ap-1682	200	7	lower	lower	ADV
ap-1682	200	8	bound	bind	VERB
ap-1682	200	9	was	be	AUX
ap-1682	200	10	set	set	VERB
ap-1682	200	11	to	to	ADP
ap-1682	200	12	the	the	DET
ap-1682	200	13	78	78	NUM
ap-1682	200	14	acta	acta	PROPN
ap-1682	200	15	polytechnica	polytechnica	PROPN
ap-1682	200	16	vol	vol	NOUN
ap-1682	200	17	.	.	PROPN
ap-1682	201	1	52	52	NUM
ap-1682	201	2	no	no	NOUN
ap-1682	201	3	.	.	PUNCT
ap-1682	202	1	6/2012	6/2012	NUM
ap-1682	202	2	group	group	NOUN
ap-1682	202	3	of	of	ADP
ap-1682	202	4	bars	bar	NOUN
ap-1682	202	5	conectivities	conectivitie	VERB
ap-1682	202	6	a1	a1	PROPN
ap-1682	202	7	1	1	NUM
ap-1682	202	8	-	-	SYM
ap-1682	202	9	2	2	NUM
ap-1682	202	10	a2	a2	NOUN
ap-1682	202	11	1	1	NUM
ap-1682	202	12	-	-	SYM
ap-1682	202	13	4	4	NUM
ap-1682	202	14	,	,	PUNCT
ap-1682	202	15	2	2	NUM
ap-1682	202	16	-	-	SYM
ap-1682	202	17	3	3	NUM
ap-1682	202	18	,	,	PUNCT
ap-1682	202	19	1	1	NUM
ap-1682	202	20	-	-	SYM
ap-1682	202	21	5	5	NUM
ap-1682	202	22	,	,	PUNCT
ap-1682	202	23	2	2	NUM
ap-1682	202	24	-	-	SYM
ap-1682	202	25	6	6	NUM
ap-1682	202	26	a3	a3	NOUN
ap-1682	202	27	2	2	NUM
ap-1682	202	28	-	-	SYM
ap-1682	202	29	5	5	NUM
ap-1682	202	30	,	,	PUNCT
ap-1682	202	31	2	2	NUM
ap-1682	202	32	-	-	SYM
ap-1682	202	33	4	4	NUM
ap-1682	202	34	,	,	PUNCT
ap-1682	202	35	1	1	NUM
ap-1682	202	36	-	-	SYM
ap-1682	202	37	3	3	NUM
ap-1682	202	38	,	,	PUNCT
ap-1682	202	39	1	1	NUM
ap-1682	202	40	-	-	SYM
ap-1682	202	41	6	6	NUM
ap-1682	202	42	a4	a4	NOUN
ap-1682	202	43	3	3	NUM
ap-1682	202	44	-	-	SYM
ap-1682	202	45	6	6	NUM
ap-1682	202	46	,	,	PUNCT
ap-1682	202	47	4	4	NUM
ap-1682	202	48	-	-	SYM
ap-1682	202	49	5	5	NUM
ap-1682	202	50	a5	a5	NOUN
ap-1682	202	51	2	2	NUM
ap-1682	202	52	-	-	SYM
ap-1682	202	53	4	4	NUM
ap-1682	202	54	,	,	PUNCT
ap-1682	202	55	5	5	NUM
ap-1682	202	56	-	-	SYM
ap-1682	202	57	6	6	NUM
ap-1682	202	58	a6	a6	NOUN
ap-1682	202	59	3	3	NUM
ap-1682	202	60	-	-	SYM
ap-1682	202	61	10	10	NUM
ap-1682	202	62	,	,	PUNCT
ap-1682	202	63	6	6	NUM
ap-1682	202	64	-	-	SYM
ap-1682	202	65	7	7	NUM
ap-1682	202	66	,	,	PUNCT
ap-1682	202	67	4	4	NUM
ap-1682	202	68	-	-	SYM
ap-1682	202	69	9	9	NUM
ap-1682	202	70	,	,	PUNCT
ap-1682	202	71	5	5	NUM
ap-1682	202	72	-	-	SYM
ap-1682	202	73	8	8	NUM
ap-1682	202	74	a7	a7	NOUN
ap-1682	202	75	3	3	NUM
ap-1682	202	76	-	-	SYM
ap-1682	202	77	8	8	NUM
ap-1682	202	78	,	,	PUNCT
ap-1682	202	79	4	4	NUM
ap-1682	202	80	-	-	SYM
ap-1682	202	81	7	7	NUM
ap-1682	202	82	,	,	PUNCT
ap-1682	202	83	6	6	NUM
ap-1682	202	84	-	-	SYM
ap-1682	202	85	9	9	NUM
ap-1682	202	86	,	,	PUNCT
ap-1682	202	87	5	5	NUM
ap-1682	202	88	-	-	SYM
ap-1682	202	89	10	10	NUM
ap-1682	202	90	a8	a8	PROPN
ap-1682	202	91	3	3	NUM
ap-1682	202	92	-	-	SYM
ap-1682	202	93	7	7	NUM
ap-1682	202	94	,	,	PUNCT
ap-1682	202	95	4	4	NUM
ap-1682	202	96	-	-	SYM
ap-1682	202	97	8	8	NUM
ap-1682	202	98	,	,	PUNCT
ap-1682	202	99	5	5	NUM
ap-1682	202	100	-	-	SYM
ap-1682	202	101	9	9	NUM
ap-1682	202	102	,	,	PUNCT
ap-1682	202	103	6	6	NUM
ap-1682	202	104	-	-	SYM
ap-1682	202	105	10	10	NUM
ap-1682	202	106	table	table	NOUN
ap-1682	202	107	2	2	NUM
ap-1682	202	108	:	:	PUNCT
ap-1682	202	109	member	member	NOUN
ap-1682	202	110	grouping	grouping	NOUN
ap-1682	202	111	for	for	ADP
ap-1682	202	112	the	the	DET
ap-1682	202	113	25	25	NUM
ap-1682	202	114	-	-	PUNCT
ap-1682	202	115	bar	bar	NOUN
ap-1682	202	116	truss	truss	NOUN
ap-1682	202	117	.	.	PUNCT
ap-1682	203	1	node	node	PROPN
ap-1682	203	2	fx	fx	PROPN
ap-1682	203	3	fy	fy	PROPN
ap-1682	203	4	fz	fz	VERB
ap-1682	203	5	1	1	NUM
ap-1682	203	6	1.0	1.0	NUM
ap-1682	203	7	−10.0	−10.0	NUM
ap-1682	203	8	−10.0	−10.0	NUM
ap-1682	203	9	2	2	NUM
ap-1682	203	10	0	0	NUM
ap-1682	203	11	−10.0	−10.0	NUM
ap-1682	203	12	−10.0	−10.0	NUM
ap-1682	203	13	3	3	NUM
ap-1682	203	14	0.5	0.5	NUM
ap-1682	203	15	0	0	NUM
ap-1682	203	16	0	0	NUM
ap-1682	203	17	6	6	NUM
ap-1682	203	18	0.6	0.6	NUM
ap-1682	203	19	0	0	NUM
ap-1682	203	20	0	0	NUM
ap-1682	203	21	table	table	NOUN
ap-1682	203	22	3	3	NUM
ap-1682	203	23	:	:	PUNCT
ap-1682	203	24	loadings	loading	NOUN
ap-1682	203	25	for	for	ADP
ap-1682	203	26	the	the	DET
ap-1682	203	27	25	25	NUM
ap-1682	203	28	-	-	PUNCT
ap-1682	203	29	bar	bar	NOUN
ap-1682	203	30	truss	truss	NOUN
ap-1682	203	31	(	(	PUNCT
ap-1682	203	32	kips	kip	NOUN
ap-1682	203	33	)	)	PUNCT
ap-1682	203	34	.	.	PUNCT
ap-1682	204	1	variable	variable	ADJ
ap-1682	204	2	unit	unit	NOUN
ap-1682	204	3	perez	perez	PROPN
ap-1682	204	4	&	&	CCONJ
ap-1682	204	5	behdinan	behdinan	PROPN
ap-1682	204	6	this	this	DET
ap-1682	204	7	paper	paper	NOUN
ap-1682	204	8	a1	a1	NOUN
ap-1682	204	9	in2	in2	PROPN
ap-1682	204	10	0.1	0.1	NUM
ap-1682	204	11	0.1	0.1	NUM
ap-1682	204	12	a2	a2	PROPN
ap-1682	204	13	in2	in2	PROPN
ap-1682	204	14	0.457	0.457	NUM
ap-1682	204	15	0.421	0.421	NUM
ap-1682	204	16	a3	a3	NOUN
ap-1682	204	17	in2	in2	PROPN
ap-1682	204	18	3.4	3.4	NUM
ap-1682	204	19	3.4	3.4	NUM
ap-1682	204	20	a4	a4	NOUN
ap-1682	204	21	in2	in2	PROPN
ap-1682	204	22	0.1	0.1	NUM
ap-1682	204	23	0.1	0.1	NUM
ap-1682	204	24	a5	a5	PROPN
ap-1682	204	25	in2	in2	PROPN
ap-1682	204	26	1.937	1.937	NUM
ap-1682	204	27	1.917	1.917	NUM
ap-1682	204	28	a6	a6	NOUN
ap-1682	204	29	in2	in2	VERB
ap-1682	204	30	0.965	0.965	NUM
ap-1682	204	31	0.966	0.966	NUM
ap-1682	205	1	a7	a7	PROPN
ap-1682	205	2	in2	in2	PROPN
ap-1682	205	3	0.442	0.442	NUM
ap-1682	205	4	0.471	0.471	NUM
ap-1682	205	5	a8	a8	PROPN
ap-1682	205	6	in2	in2	PROPN
ap-1682	205	7	3.4	3.4	NUM
ap-1682	205	8	3.4	3.4	NUM
ap-1682	205	9	m	m	NOUN
ap-1682	205	10	lb	lb	ADP
ap-1682	205	11	483.84	483.84	NUM
ap-1682	205	12	483.82	483.82	NUM
ap-1682	205	13	max	max	PROPN
ap-1682	205	14	|σi|	|σi|	PROPN
ap-1682	205	15	ksi	ksi	PROPN
ap-1682	205	16	6.15	6.15	NUM
ap-1682	205	17	6.13	6.13	NUM
ap-1682	205	18	max	max	NOUN
ap-1682	205	19	|wj	|wj	X
ap-1682	206	1	|	|	ADV
ap-1682	206	2	in	in	ADP
ap-1682	206	3	0.35	0.35	NUM
ap-1682	206	4	0.35	0.35	NUM
ap-1682	206	5	σlim	σlim	NOUN
ap-1682	206	6	ksi	ksi	NOUN
ap-1682	206	7	40	40	NUM
ap-1682	206	8	40	40	NUM
ap-1682	206	9	wlim	wlim	NOUN
ap-1682	206	10	in	in	ADP
ap-1682	206	11	0.35	0.35	NUM
ap-1682	206	12	0.35	0.35	NUM
ap-1682	206	13	table	table	NOUN
ap-1682	206	14	4	4	NUM
ap-1682	206	15	:	:	PUNCT
ap-1682	206	16	comparison	comparison	NOUN
ap-1682	206	17	of	of	ADP
ap-1682	206	18	results	result	NOUN
ap-1682	206	19	for	for	ADP
ap-1682	206	20	the	the	DET
ap-1682	206	21	25	25	NUM
ap-1682	206	22	-	-	PUNCT
ap-1682	206	23	bar	bar	NOUN
ap-1682	206	24	truss	truss	ADJ
ap-1682	206	25	continuous	continuous	ADJ
ap-1682	206	26	case	case	NOUN
ap-1682	206	27	.	.	PUNCT
ap-1682	207	1	1	1	NUM
ap-1682	207	2	2	2	NUM
ap-1682	207	3	3	3	NUM
ap-1682	207	4	4	4	NUM
ap-1682	207	5	5	5	NUM
ap-1682	207	6	6	6	NUM
ap-1682	207	7	7	7	NUM
ap-1682	207	8	8	8	NUM
ap-1682	207	9	1	1	NUM
ap-1682	207	10	2	2	NUM
ap-1682	207	11	3	3	NUM
ap-1682	207	12	4	4	NUM
ap-1682	207	13	5	5	NUM
ap-1682	207	14	6	6	NUM
ap-1682	207	15	7	7	NUM
ap-1682	207	16	8	8	NUM
ap-1682	207	17	sp	sp	ADP
ap-1682	207	18	ee	ee	NOUN
ap-1682	207	19	dup	dup	NOUN
ap-1682	207	20	number	number	NOUN
ap-1682	207	21	of	of	ADP
ap-1682	207	22	cores	core	NOUN
ap-1682	207	23	speed	speed	NOUN
ap-1682	207	24	-	-	PUNCT
ap-1682	207	25	up	up	ADP
ap-1682	207	26	linear	linear	ADJ
ap-1682	207	27	speed	speed	NOUN
ap-1682	207	28	-	-	PUNCT
ap-1682	207	29	up	up	ADP
ap-1682	207	30	figure	figure	NOUN
ap-1682	207	31	5	5	NUM
ap-1682	207	32	:	:	PUNCT
ap-1682	207	33	a	a	DET
ap-1682	207	34	speed	speed	NOUN
ap-1682	207	35	-	-	PUNCT
ap-1682	207	36	up	up	NOUN
ap-1682	207	37	of	of	ADP
ap-1682	207	38	the	the	DET
ap-1682	207	39	25	25	NUM
ap-1682	207	40	-	-	PUNCT
ap-1682	207	41	bar	bar	NOUN
ap-1682	207	42	truss	truss	NOUN
ap-1682	207	43	problem	problem	NOUN
ap-1682	207	44	solved	solve	VERB
ap-1682	207	45	by	by	ADP
ap-1682	207	46	the	the	DET
ap-1682	207	47	parallel	parallel	ADJ
ap-1682	207	48	branch	branch	NOUN
ap-1682	207	49	and	and	CCONJ
ap-1682	207	50	bound	bind	VERB
ap-1682	207	51	method	method	NOUN
ap-1682	207	52	.	.	PUNCT
ap-1682	208	1	value	value	NOUN
ap-1682	208	2	found	find	VERB
ap-1682	208	3	with	with	ADP
ap-1682	208	4	continuous	continuous	ADJ
ap-1682	208	5	optimization	optimization	NOUN
ap-1682	208	6	,	,	PUNCT
ap-1682	208	7	and	and	CCONJ
ap-1682	208	8	the	the	DET
ap-1682	208	9	upper	upper	ADJ
ap-1682	208	10	bound	bind	VERB
ap-1682	208	11	was	be	AUX
ap-1682	208	12	set	set	VERB
ap-1682	208	13	to	to	ADP
ap-1682	208	14	the	the	DET
ap-1682	208	15	worst	bad	ADJ
ap-1682	208	16	available	available	ADJ
ap-1682	208	17	solution	solution	NOUN
ap-1682	208	18	in	in	ADP
ap-1682	208	19	the	the	DET
ap-1682	208	20	literature	literature	NOUN
ap-1682	208	21	[	[	X
ap-1682	208	22	12	12	NUM
ap-1682	208	23	]	]	PUNCT
ap-1682	208	24	.	.	PUNCT
ap-1682	209	1	6	6	NUM
ap-1682	209	2	parallelization	parallelization	NOUN
ap-1682	209	3	the	the	DET
ap-1682	209	4	25	25	NUM
ap-1682	209	5	-	-	PUNCT
ap-1682	209	6	bar	bar	NOUN
ap-1682	209	7	truss	truss	NOUN
ap-1682	209	8	is	be	AUX
ap-1682	209	9	relatively	relatively	ADV
ap-1682	209	10	computationally	computationally	ADV
ap-1682	209	11	demanding	demanding	ADJ
ap-1682	209	12	.	.	PUNCT
ap-1682	210	1	since	since	SCONJ
ap-1682	210	2	the	the	DET
ap-1682	210	3	evaluations	evaluation	NOUN
ap-1682	210	4	of	of	ADP
ap-1682	210	5	the	the	DET
ap-1682	210	6	solutions	solution	NOUN
ap-1682	210	7	are	be	AUX
ap-1682	210	8	independent	independent	ADJ
ap-1682	210	9	from	from	ADP
ap-1682	210	10	each	each	DET
ap-1682	210	11	other	other	ADJ
ap-1682	210	12	(	(	PUNCT
ap-1682	210	13	except	except	SCONJ
ap-1682	210	14	updating	update	VERB
ap-1682	210	15	the	the	DET
ap-1682	210	16	upper	upper	ADJ
ap-1682	210	17	bound	bind	VERB
ap-1682	210	18	mmax	mmax	NOUN
ap-1682	210	19	,	,	PUNCT
ap-1682	210	20	as	as	SCONJ
ap-1682	210	21	described	describe	VERB
ap-1682	210	22	in	in	ADP
ap-1682	210	23	step	step	NOUN
ap-1682	210	24	4a	4a	NOUN
ap-1682	210	25	of	of	ADP
ap-1682	210	26	the	the	DET
ap-1682	210	27	algorithm	algorithm	NOUN
ap-1682	210	28	)	)	PUNCT
ap-1682	210	29	,	,	PUNCT
ap-1682	210	30	the	the	DET
ap-1682	210	31	method	method	NOUN
ap-1682	210	32	can	can	AUX
ap-1682	210	33	be	be	AUX
ap-1682	210	34	run	run	VERB
ap-1682	210	35	in	in	ADP
ap-1682	210	36	a	a	DET
ap-1682	210	37	parallel	parallel	ADJ
ap-1682	210	38	way	way	NOUN
ap-1682	210	39	.	.	PUNCT
ap-1682	211	1	nowadays	nowadays	ADV
ap-1682	211	2	,	,	PUNCT
ap-1682	211	3	modern	modern	ADJ
ap-1682	211	4	computers	computer	NOUN
ap-1682	211	5	are	be	AUX
ap-1682	211	6	equipped	equip	VERB
ap-1682	211	7	with	with	ADP
ap-1682	211	8	several	several	ADJ
ap-1682	211	9	core	core	NOUN
ap-1682	211	10	processors	processor	NOUN
ap-1682	211	11	,	,	PUNCT
ap-1682	211	12	and	and	CCONJ
ap-1682	211	13	we	we	PRON
ap-1682	211	14	can	can	AUX
ap-1682	211	15	to	to	PART
ap-1682	211	16	make	make	VERB
ap-1682	211	17	use	use	NOUN
ap-1682	211	18	of	of	ADP
ap-1682	211	19	this	this	DET
ap-1682	211	20	computational	computational	ADJ
ap-1682	211	21	power	power	NOUN
ap-1682	211	22	.	.	PUNCT
ap-1682	212	1	the	the	DET
ap-1682	212	2	matlab	matlab	PROPN
ap-1682	212	3	environment	environment	NOUN
ap-1682	212	4	offers	offer	VERB
ap-1682	212	5	several	several	ADJ
ap-1682	212	6	parallelization	parallelization	NOUN
ap-1682	212	7	tools	tool	NOUN
ap-1682	212	8	,	,	PUNCT
ap-1682	212	9	but	but	CCONJ
ap-1682	212	10	not	not	PART
ap-1682	212	11	all	all	PRON
ap-1682	212	12	of	of	ADP
ap-1682	212	13	them	they	PRON
ap-1682	212	14	provide	provide	VERB
ap-1682	212	15	shared	shared	ADJ
ap-1682	212	16	memory	memory	NOUN
ap-1682	212	17	.	.	PUNCT
ap-1682	213	1	this	this	DET
ap-1682	213	2	consideration	consideration	NOUN
ap-1682	213	3	is	be	AUX
ap-1682	213	4	essential	essential	ADJ
ap-1682	213	5	for	for	ADP
ap-1682	213	6	our	our	PRON
ap-1682	213	7	algorithm	algorithm	NOUN
ap-1682	213	8	for	for	ADP
ap-1682	213	9	updating	update	VERB
ap-1682	213	10	the	the	DET
ap-1682	213	11	upper	upper	ADJ
ap-1682	213	12	bound	bind	VERB
ap-1682	213	13	.	.	PUNCT
ap-1682	214	1	the	the	DET
ap-1682	214	2	appropriate	appropriate	ADJ
ap-1682	214	3	method	method	NOUN
ap-1682	214	4	is	be	AUX
ap-1682	214	5	the	the	DET
ap-1682	214	6	spmd	spmd	NOUN
ap-1682	214	7	method	method	NOUN
ap-1682	214	8	,	,	PUNCT
ap-1682	214	9	i.e.	i.e.	X
ap-1682	214	10	,	,	PUNCT
ap-1682	214	11	the	the	DET
ap-1682	214	12	single	single	ADJ
ap-1682	214	13	programm	programm	PROPN
ap-1682	214	14	multiple	multiple	ADJ
ap-1682	214	15	data	datum	NOUN
ap-1682	214	16	method	method	NOUN
ap-1682	214	17	,	,	PUNCT
ap-1682	214	18	see	see	VERB
ap-1682	215	1	e.g.	e.g.	ADV
ap-1682	215	2	[	[	X
ap-1682	215	3	13	13	NUM
ap-1682	215	4	]	]	PUNCT
ap-1682	215	5	for	for	ADP
ap-1682	215	6	more	more	ADJ
ap-1682	215	7	details	detail	NOUN
ap-1682	215	8	.	.	PUNCT
ap-1682	216	1	the	the	DET
ap-1682	216	2	spmd	spmd	NOUN
ap-1682	216	3	statement	statement	NOUN
ap-1682	216	4	separates	separate	VERB
ap-1682	216	5	the	the	DET
ap-1682	216	6	block	block	NOUN
ap-1682	216	7	of	of	ADP
ap-1682	216	8	the	the	DET
ap-1682	216	9	code	code	NOUN
ap-1682	216	10	to	to	PART
ap-1682	216	11	be	be	AUX
ap-1682	216	12	run	run	VERB
ap-1682	216	13	simultaneously	simultaneously	ADV
ap-1682	216	14	on	on	ADP
ap-1682	216	15	multiple	multiple	ADJ
ap-1682	216	16	labs	lab	NOUN
ap-1682	216	17	.	.	PUNCT
ap-1682	217	1	as	as	ADP
ap-1682	217	2	in	in	ADP
ap-1682	217	3	the	the	DET
ap-1682	217	4	parfor	parfor	NOUN
ap-1682	217	5	loop	loop	NOUN
ap-1682	217	6	method	method	NOUN
ap-1682	217	7	,	,	PUNCT
ap-1682	217	8	the	the	DET
ap-1682	217	9	matlabpool	matlabpool	NOUN
ap-1682	217	10	open	open	ADJ
ap-1682	217	11	n	n	PRON
ap-1682	217	12	command	command	NOUN
ap-1682	217	13	opens	open	VERB
ap-1682	217	14	the	the	DET
ap-1682	217	15	required	require	VERB
ap-1682	217	16	number	number	NOUN
ap-1682	217	17	of	of	ADP
ap-1682	217	18	labs	lab	NOUN
ap-1682	217	19	.	.	PUNCT
ap-1682	218	1	data	datum	NOUN
ap-1682	218	2	can	can	AUX
ap-1682	218	3	be	be	AUX
ap-1682	218	4	sent	send	VERB
ap-1682	218	5	to	to	ADP
ap-1682	218	6	another	another	DET
ap-1682	218	7	lab	lab	NOUN
ap-1682	218	8	by	by	ADP
ap-1682	218	9	the	the	DET
ap-1682	218	10	labsend(data	labsend(data	PROPN
ap-1682	218	11	,	,	PUNCT
ap-1682	218	12	x	x	X
ap-1682	218	13	)	)	PUNCT
ap-1682	218	14	command	command	NOUN
ap-1682	218	15	,	,	PUNCT
ap-1682	218	16	where	where	SCONJ
ap-1682	218	17	x	x	PRON
ap-1682	218	18	is	be	AUX
ap-1682	218	19	the	the	DET
ap-1682	218	20	index	index	NOUN
ap-1682	218	21	of	of	ADP
ap-1682	218	22	the	the	DET
ap-1682	218	23	receiving	receive	VERB
ap-1682	218	24	lab	lab	NOUN
ap-1682	218	25	to	to	PART
ap-1682	218	26	which	which	PRON
ap-1682	218	27	the	the	DET
ap-1682	218	28	data	data	NOUN
ap-1682	218	29	is	be	AUX
ap-1682	218	30	sent	send	VERB
ap-1682	218	31	.	.	PUNCT
ap-1682	219	1	the	the	DET
ap-1682	219	2	data	data	NOUN
ap-1682	219	3	is	be	AUX
ap-1682	219	4	received	receive	VERB
ap-1682	219	5	by	by	ADP
ap-1682	219	6	the	the	DET
ap-1682	219	7	labreceive(y	labreceive(y	PROPN
ap-1682	219	8	)	)	PUNCT
ap-1682	219	9	command	command	NOUN
ap-1682	219	10	,	,	PUNCT
ap-1682	219	11	where	where	SCONJ
ap-1682	219	12	y	y	PROPN
ap-1682	219	13	is	be	AUX
ap-1682	219	14	the	the	DET
ap-1682	219	15	index	index	NOUN
ap-1682	219	16	of	of	ADP
ap-1682	219	17	the	the	DET
ap-1682	219	18	lab	lab	NOUN
ap-1682	219	19	from	from	ADP
ap-1682	219	20	which	which	PRON
ap-1682	219	21	the	the	DET
ap-1682	219	22	data	datum	NOUN
ap-1682	219	23	will	will	AUX
ap-1682	219	24	come	come	VERB
ap-1682	219	25	.	.	PUNCT
ap-1682	220	1	it	it	PRON
ap-1682	220	2	is	be	AUX
ap-1682	220	3	appropriate	appropriate	ADJ
ap-1682	220	4	to	to	PART
ap-1682	220	5	split	split	VERB
ap-1682	220	6	the	the	DET
ap-1682	220	7	data	datum	NOUN
ap-1682	220	8	only	only	ADV
ap-1682	220	9	at	at	ADP
ap-1682	220	10	one	one	NUM
ap-1682	220	11	so	so	ADV
ap-1682	220	12	-	-	PUNCT
ap-1682	220	13	called	call	VERB
ap-1682	220	14	master	master	NOUN
ap-1682	220	15	lab	lab	NOUN
ap-1682	220	16	and	and	CCONJ
ap-1682	220	17	to	to	PART
ap-1682	220	18	receive	receive	VERB
ap-1682	220	19	data	datum	NOUN
ap-1682	220	20	with	with	ADP
ap-1682	220	21	the	the	DET
ap-1682	220	22	other	other	ADJ
ap-1682	220	23	so	so	ADV
ap-1682	220	24	-	-	PUNCT
ap-1682	220	25	called	call	VERB
ap-1682	220	26	slaves	slave	NOUN
ap-1682	220	27	.	.	PUNCT
ap-1682	221	1	the	the	DET
ap-1682	221	2	master	master	NOUN
ap-1682	221	3	can	can	AUX
ap-1682	221	4	also	also	ADV
ap-1682	221	5	process	process	VERB
ap-1682	221	6	its	its	PRON
ap-1682	221	7	own	own	ADJ
ap-1682	221	8	data	datum	NOUN
ap-1682	221	9	as	as	ADV
ap-1682	221	10	well	well	ADV
ap-1682	221	11	.	.	PUNCT
ap-1682	222	1	the	the	DET
ap-1682	222	2	main	main	ADJ
ap-1682	222	3	problem	problem	NOUN
ap-1682	222	4	here	here	ADV
ap-1682	222	5	is	be	AUX
ap-1682	222	6	to	to	PART
ap-1682	222	7	estimate	estimate	VERB
ap-1682	222	8	a	a	DET
ap-1682	222	9	proper	proper	ADJ
ap-1682	222	10	amount	amount	NOUN
ap-1682	222	11	of	of	ADP
ap-1682	222	12	data	datum	NOUN
ap-1682	222	13	for	for	ADP
ap-1682	222	14	each	each	DET
ap-1682	222	15	lab	lab	NOUN
ap-1682	222	16	.	.	PUNCT
ap-1682	223	1	if	if	SCONJ
ap-1682	223	2	the	the	DET
ap-1682	223	3	data	data	NOUN
ap-1682	223	4	is	be	AUX
ap-1682	223	5	sent	send	VERB
ap-1682	223	6	too	too	ADV
ap-1682	223	7	often	often	ADV
ap-1682	223	8	communication	communication	NOUN
ap-1682	223	9	between	between	ADP
ap-1682	223	10	master	master	NOUN
ap-1682	223	11	and	and	CCONJ
ap-1682	223	12	slaves	slave	NOUN
ap-1682	223	13	is	be	AUX
ap-1682	223	14	too	too	ADV
ap-1682	223	15	costly	costly	ADJ
ap-1682	223	16	.	.	PUNCT
ap-1682	224	1	in	in	ADP
ap-1682	224	2	the	the	DET
ap-1682	224	3	25	25	NUM
ap-1682	224	4	-	-	PUNCT
ap-1682	224	5	bar	bar	NOUN
ap-1682	224	6	truss	truss	NOUN
ap-1682	224	7	task	task	NOUN
ap-1682	224	8	,	,	PUNCT
ap-1682	224	9	permutations	permutation	NOUN
ap-1682	224	10	with	with	ADP
ap-1682	224	11	repetition	repetition	NOUN
ap-1682	224	12	are	be	AUX
ap-1682	224	13	generated	generate	VERB
ap-1682	224	14	in	in	ADP
ap-1682	224	15	advance	advance	NOUN
ap-1682	224	16	for	for	ADP
ap-1682	224	17	several	several	ADJ
ap-1682	224	18	groups	group	NOUN
ap-1682	224	19	of	of	ADP
ap-1682	224	20	elements	element	NOUN
ap-1682	224	21	(	(	PUNCT
ap-1682	224	22	e.g.	e.g.	ADV
ap-1682	224	23	four	four	NUM
ap-1682	224	24	groups	group	NOUN
ap-1682	224	25	)	)	PUNCT
ap-1682	224	26	,	,	PUNCT
ap-1682	224	27	and	and	CCONJ
ap-1682	224	28	the	the	DET
ap-1682	224	29	remaining	remain	VERB
ap-1682	224	30	groups	group	NOUN
ap-1682	224	31	of	of	ADP
ap-1682	224	32	elements	element	NOUN
ap-1682	224	33	(	(	PUNCT
ap-1682	224	34	four	four	NUM
ap-1682	224	35	other	other	ADJ
ap-1682	224	36	groups	group	NOUN
ap-1682	224	37	)	)	PUNCT
ap-1682	224	38	are	be	AUX
ap-1682	224	39	generated	generate	VERB
ap-1682	224	40	in	in	ADP
ap-1682	224	41	the	the	DET
ap-1682	224	42	branch	branch	NOUN
ap-1682	224	43	and	and	CCONJ
ap-1682	224	44	bound	bind	VERB
ap-1682	224	45	method	method	NOUN
ap-1682	224	46	independently	independently	ADV
ap-1682	224	47	at	at	ADP
ap-1682	224	48	each	each	DET
ap-1682	224	49	lab	lab	NOUN
ap-1682	224	50	.	.	PUNCT
ap-1682	225	1	the	the	DET
ap-1682	225	2	generated	generate	VERB
ap-1682	225	3	combinations	combination	NOUN
ap-1682	225	4	are	be	AUX
ap-1682	225	5	assigned	assign	VERB
ap-1682	225	6	to	to	ADP
ap-1682	225	7	individual	individual	ADJ
ap-1682	225	8	labs	lab	NOUN
ap-1682	225	9	in	in	ADP
ap-1682	225	10	advance	advance	NOUN
ap-1682	225	11	,	,	PUNCT
ap-1682	225	12	and	and	CCONJ
ap-1682	225	13	then	then	ADV
ap-1682	225	14	the	the	DET
ap-1682	225	15	algorithm	algorithm	NOUN
ap-1682	225	16	continues	continue	VERB
ap-1682	225	17	in	in	ADP
ap-1682	225	18	the	the	DET
ap-1682	225	19	same	same	ADJ
ap-1682	225	20	way	way	NOUN
ap-1682	225	21	as	as	ADP
ap-1682	225	22	for	for	ADP
ap-1682	225	23	the	the	DET
ap-1682	225	24	5	5	NUM
ap-1682	225	25	-	-	PUNCT
ap-1682	225	26	bar	bar	NOUN
ap-1682	225	27	truss	truss	NOUN
ap-1682	225	28	task	task	NOUN
ap-1682	225	29	.	.	PUNCT
ap-1682	226	1	the	the	DET
ap-1682	226	2	maximum	maximum	ADJ
ap-1682	226	3	mmax	mmax	ADJ
ap-1682	226	4	values	value	NOUN
ap-1682	226	5	are	be	AUX
ap-1682	226	6	collected	collect	VERB
ap-1682	226	7	at	at	ADP
ap-1682	226	8	the	the	DET
ap-1682	226	9	end	end	NOUN
ap-1682	226	10	79	79	NUM
ap-1682	226	11	acta	acta	PROPN
ap-1682	226	12	polytechnica	polytechnica	PROPN
ap-1682	226	13	vol	vol	NOUN
ap-1682	226	14	.	.	PROPN
ap-1682	227	1	52	52	NUM
ap-1682	227	2	no	no	NOUN
ap-1682	227	3	.	.	PUNCT
ap-1682	228	1	6/2012	6/2012	NUM
ap-1682	228	2	480	480	NUM
ap-1682	228	3	500	500	NUM
ap-1682	228	4	520	520	NUM
ap-1682	228	5	540	540	NUM
ap-1682	228	6	560	560	NUM
ap-1682	228	7	1	1	NUM
ap-1682	228	8	10	10	NUM
ap-1682	228	9	100	100	NUM
ap-1682	228	10	1000	1000	NUM
ap-1682	228	11	10000	10000	NUM
ap-1682	228	12	we	we	PRON
ap-1682	228	13	ig	ig	INTJ
ap-1682	228	14	ht	ht	PROPN
ap-1682	229	1	[	[	X
ap-1682	229	2	l	l	NOUN
ap-1682	229	3	b	b	X
ap-1682	229	4	]	]	X
ap-1682	229	5	iterations	iteration	NOUN
ap-1682	229	6	of	of	ADP
ap-1682	229	7	the	the	DET
ap-1682	229	8	algorithm	algorithm	NOUN
ap-1682	229	9	figure	figure	NOUN
ap-1682	229	10	6	6	NUM
ap-1682	229	11	:	:	PUNCT
ap-1682	229	12	a	a	DET
ap-1682	229	13	graph	graph	NOUN
ap-1682	229	14	of	of	ADP
ap-1682	229	15	the	the	DET
ap-1682	229	16	decreasing	decrease	VERB
ap-1682	229	17	upper	upper	ADJ
ap-1682	229	18	bound	bind	VERB
ap-1682	229	19	for	for	ADP
ap-1682	229	20	the	the	DET
ap-1682	229	21	25	25	NUM
ap-1682	229	22	-	-	PUNCT
ap-1682	229	23	bar	bar	NOUN
ap-1682	229	24	truss	truss	NOUN
ap-1682	229	25	problem	problem	NOUN
ap-1682	229	26	.	.	PUNCT
ap-1682	230	1	of	of	ADP
ap-1682	230	2	each	each	DET
ap-1682	230	3	iteration	iteration	NOUN
ap-1682	230	4	.	.	PUNCT
ap-1682	231	1	the	the	DET
ap-1682	231	2	smallest	small	ADJ
ap-1682	231	3	one	one	NOUN
ap-1682	231	4	is	be	AUX
ap-1682	231	5	chosen	choose	VERB
ap-1682	231	6	as	as	ADP
ap-1682	231	7	a	a	DET
ap-1682	231	8	new	new	ADJ
ap-1682	231	9	mmax	mmax	NOUN
ap-1682	231	10	and	and	CCONJ
ap-1682	231	11	is	be	AUX
ap-1682	231	12	resent	resent	ADJ
ap-1682	231	13	to	to	ADP
ap-1682	231	14	every	every	DET
ap-1682	231	15	lab	lab	NOUN
ap-1682	231	16	as	as	ADP
ap-1682	231	17	an	an	DET
ap-1682	231	18	initial	initial	ADJ
ap-1682	231	19	value	value	NOUN
ap-1682	231	20	of	of	ADP
ap-1682	231	21	mmax	mmax	NOUN
ap-1682	231	22	for	for	ADP
ap-1682	231	23	another	another	DET
ap-1682	231	24	iteration	iteration	NOUN
ap-1682	231	25	.	.	PUNCT
ap-1682	232	1	if	if	SCONJ
ap-1682	232	2	all	all	DET
ap-1682	232	3	data	datum	NOUN
ap-1682	232	4	has	have	AUX
ap-1682	232	5	been	be	AUX
ap-1682	232	6	used	use	VERB
ap-1682	232	7	,	,	PUNCT
ap-1682	232	8	the	the	DET
ap-1682	232	9	smallest	small	ADJ
ap-1682	232	10	value	value	NOUN
ap-1682	232	11	of	of	ADP
ap-1682	232	12	mmax	mmax	NOUN
ap-1682	232	13	is	be	AUX
ap-1682	232	14	taken	take	VERB
ap-1682	232	15	as	as	ADP
ap-1682	232	16	the	the	DET
ap-1682	232	17	global	global	ADJ
ap-1682	232	18	optimum	optimum	NOUN
ap-1682	232	19	.	.	PUNCT
ap-1682	233	1	for	for	ADP
ap-1682	233	2	the	the	DET
ap-1682	233	3	parallel	parallel	ADJ
ap-1682	233	4	version	version	NOUN
ap-1682	233	5	of	of	ADP
ap-1682	233	6	the	the	DET
ap-1682	233	7	algorithm	algorithm	NOUN
ap-1682	233	8	,	,	PUNCT
ap-1682	233	9	scaling	scale	VERB
ap-1682	233	10	the	the	DET
ap-1682	233	11	algorithm	algorithm	NOUN
ap-1682	233	12	is	be	AUX
ap-1682	233	13	very	very	ADV
ap-1682	233	14	important	important	ADJ
ap-1682	233	15	.	.	PUNCT
ap-1682	234	1	if	if	SCONJ
ap-1682	234	2	the	the	DET
ap-1682	234	3	algorithm	algorithm	NOUN
ap-1682	234	4	is	be	AUX
ap-1682	234	5	scaled	scale	VERB
ap-1682	234	6	badly	badly	ADV
ap-1682	234	7	,	,	PUNCT
ap-1682	234	8	parallelization	parallelization	NOUN
ap-1682	234	9	is	be	AUX
ap-1682	234	10	not	not	PART
ap-1682	234	11	useful	useful	ADJ
ap-1682	234	12	at	at	ADV
ap-1682	234	13	all	all	ADV
ap-1682	234	14	.	.	PUNCT
ap-1682	235	1	ideally	ideally	ADV
ap-1682	235	2	,	,	PUNCT
ap-1682	235	3	we	we	PRON
ap-1682	235	4	would	would	AUX
ap-1682	235	5	like	like	VERB
ap-1682	235	6	to	to	PART
ap-1682	235	7	achieve	achieve	VERB
ap-1682	235	8	linear	linear	ADJ
ap-1682	235	9	scaling	scaling	NOUN
ap-1682	235	10	,	,	PUNCT
ap-1682	235	11	i.e.	i.e.	X
ap-1682	235	12	,	,	PUNCT
ap-1682	235	13	speed	speed	NOUN
ap-1682	235	14	-	-	PUNCT
ap-1682	235	15	up	up	NOUN
ap-1682	235	16	of	of	ADP
ap-1682	235	17	n	n	NOUN
ap-1682	235	18	on	on	ADP
ap-1682	235	19	n	n	DET
ap-1682	235	20	cores	core	NOUN
ap-1682	235	21	.	.	PUNCT
ap-1682	236	1	however	however	ADV
ap-1682	236	2	,	,	PUNCT
ap-1682	236	3	it	it	PRON
ap-1682	236	4	is	be	AUX
ap-1682	236	5	very	very	ADV
ap-1682	236	6	hard	hard	ADJ
ap-1682	236	7	to	to	PART
ap-1682	236	8	obtain	obtain	VERB
ap-1682	236	9	linear	linear	ADJ
ap-1682	236	10	scaling	scaling	NOUN
ap-1682	236	11	,	,	PUNCT
ap-1682	236	12	e.g.	e.g.	ADV
ap-1682	236	13	because	because	SCONJ
ap-1682	236	14	of	of	ADP
ap-1682	236	15	the	the	DET
ap-1682	236	16	time	time	NOUN
ap-1682	236	17	spent	spend	VERB
ap-1682	236	18	on	on	ADP
ap-1682	236	19	communications	communication	NOUN
ap-1682	236	20	.	.	PUNCT
ap-1682	237	1	fig	fig	NOUN
ap-1682	237	2	.	.	PUNCT
ap-1682	238	1	5	5	NUM
ap-1682	238	2	shows	show	VERB
ap-1682	238	3	a	a	DET
ap-1682	238	4	graph	graph	NOUN
ap-1682	238	5	where	where	SCONJ
ap-1682	238	6	the	the	DET
ap-1682	238	7	speed	speed	NOUN
ap-1682	238	8	-	-	PUNCT
ap-1682	238	9	up	up	NOUN
ap-1682	238	10	of	of	ADP
ap-1682	238	11	the	the	DET
ap-1682	238	12	parallel	parallel	ADJ
ap-1682	238	13	algorithm	algorithm	NOUN
ap-1682	238	14	is	be	AUX
ap-1682	238	15	compared	compare	VERB
ap-1682	238	16	at	at	ADP
ap-1682	238	17	1	1	NUM
ap-1682	238	18	to	to	PART
ap-1682	238	19	8	8	NUM
ap-1682	238	20	labs1	labs1	NOUN
ap-1682	238	21	.	.	PUNCT
ap-1682	239	1	the	the	DET
ap-1682	239	2	hp	hp	PROPN
ap-1682	239	3	xeon	xeon	PROPN
ap-1682	239	4	z600	z600	PROPN
ap-1682	239	5	workstation	workstation	NOUN
ap-1682	239	6	with	with	ADP
ap-1682	239	7	two	two	NUM
ap-1682	239	8	intel	intel	PROPN
ap-1682	239	9	xeon	xeon	PROPN
ap-1682	239	10	e5520	e5520	PROPN
ap-1682	239	11	4	4	NUM
ap-1682	239	12	-	-	PUNCT
ap-1682	239	13	cores	core	NOUN
ap-1682	239	14	processors	processor	NOUN
ap-1682	239	15	,	,	PUNCT
ap-1682	239	16	frequency	frequency	NOUN
ap-1682	239	17	2.27ghz	2.27ghz	PROPN
ap-1682	239	18	was	be	AUX
ap-1682	239	19	used	use	VERB
ap-1682	239	20	for	for	ADP
ap-1682	239	21	computations	computation	NOUN
ap-1682	239	22	within	within	ADP
ap-1682	239	23	the	the	DET
ap-1682	239	24	matlab	matlab	PROPN
ap-1682	239	25	r2009a	r2009a	PROPN
ap-1682	239	26	64	64	NUM
ap-1682	239	27	-	-	PUNCT
ap-1682	239	28	bit	bit	NOUN
ap-1682	239	29	debian	debian	ADJ
ap-1682	239	30	gnu	gnu	PROPN
ap-1682	239	31	/	/	SYM
ap-1682	239	32	linux	linux	PROPN
ap-1682	239	33	environment	environment	NOUN
ap-1682	239	34	.	.	PUNCT
ap-1682	240	1	7	7	NUM
ap-1682	240	2	conclusions	conclusion	NOUN
ap-1682	240	3	fig	fig	NOUN
ap-1682	240	4	.	.	PUNCT
ap-1682	241	1	6	6	NUM
ap-1682	241	2	shows	show	VERB
ap-1682	241	3	a	a	DET
ap-1682	241	4	graph	graph	NOUN
ap-1682	241	5	with	with	ADP
ap-1682	241	6	the	the	DET
ap-1682	241	7	decreasing	decrease	VERB
ap-1682	241	8	upper	upper	ADJ
ap-1682	241	9	bound	bind	VERB
ap-1682	241	10	mmax	mmax	NOUN
ap-1682	241	11	for	for	ADP
ap-1682	241	12	the	the	DET
ap-1682	241	13	25	25	NUM
ap-1682	241	14	-	-	PUNCT
ap-1682	241	15	bar	bar	NOUN
ap-1682	241	16	truss	truss	NOUN
ap-1682	241	17	problem	problem	NOUN
ap-1682	241	18	.	.	PUNCT
ap-1682	242	1	the	the	DET
ap-1682	242	2	value	value	NOUN
ap-1682	242	3	ofmmax	ofmmax	NOUN
ap-1682	242	4	determines	determine	VERB
ap-1682	242	5	the	the	DET
ap-1682	242	6	best	good	ADJ
ap-1682	242	7	-	-	PUNCT
ap-1682	242	8	so	so	ADV
ap-1682	242	9	-	-	PUNCT
ap-1682	242	10	far	far	ADJ
ap-1682	242	11	solution	solution	NOUN
ap-1682	242	12	found	find	VERB
ap-1682	242	13	during	during	ADP
ap-1682	242	14	the	the	DET
ap-1682	242	15	whole	whole	ADJ
ap-1682	242	16	algorithm	algorithm	NOUN
ap-1682	242	17	run	run	NOUN
ap-1682	242	18	.	.	PUNCT
ap-1682	243	1	it	it	PRON
ap-1682	243	2	can	can	AUX
ap-1682	243	3	be	be	AUX
ap-1682	243	4	interpreted	interpret	VERB
ap-1682	243	5	as	as	ADP
ap-1682	243	6	the	the	DET
ap-1682	243	7	convergence	convergence	NOUN
ap-1682	243	8	of	of	ADP
ap-1682	243	9	the	the	DET
ap-1682	243	10	objective	objective	ADJ
ap-1682	243	11	function	function	NOUN
ap-1682	243	12	to	to	ADP
ap-1682	243	13	the	the	DET
ap-1682	243	14	global	global	ADJ
ap-1682	243	15	optimum	optimum	NOUN
ap-1682	243	16	.	.	PUNCT
ap-1682	244	1	all	all	DET
ap-1682	244	2	combinations	combination	NOUN
ap-1682	244	3	generated	generate	VERB
ap-1682	244	4	in	in	ADP
ap-1682	244	5	advance	advance	NOUN
ap-1682	244	6	were	be	AUX
ap-1682	244	7	divided	divide	VERB
ap-1682	244	8	into	into	ADP
ap-1682	244	9	smaller	small	ADJ
ap-1682	244	10	blocks	block	NOUN
ap-1682	244	11	of	of	ADP
ap-1682	244	12	data	datum	NOUN
ap-1682	244	13	containing	contain	VERB
ap-1682	244	14	fifty	fifty	NUM
ap-1682	244	15	combinations	combination	NOUN
ap-1682	244	16	and	and	CCONJ
ap-1682	244	17	these	these	DET
ap-1682	244	18	“	"	PUNCT
ap-1682	244	19	packs	pack	NOUN
ap-1682	244	20	”	"	PUNCT
ap-1682	244	21	were	be	AUX
ap-1682	244	22	sequentially	sequentially	ADV
ap-1682	244	23	sent	send	VERB
ap-1682	244	24	to	to	ADP
ap-1682	244	25	eight	eight	NUM
ap-1682	244	26	labs	lab	NOUN
ap-1682	244	27	.	.	PUNCT
ap-1682	245	1	the	the	DET
ap-1682	245	2	number	number	NOUN
ap-1682	245	3	of	of	ADP
ap-1682	245	4	all	all	DET
ap-1682	245	5	iterations	iteration	NOUN
ap-1682	245	6	was	be	AUX
ap-1682	245	7	therefore	therefore	ADV
ap-1682	245	8	304/(8	304/(8	NUM
ap-1682	245	9	·	·	SYM
ap-1682	245	10	50	50	NUM
ap-1682	245	11	)	)	PUNCT
ap-1682	245	12	=	=	SYM
ap-1682	245	13	2025	2025	NUM
ap-1682	245	14	.	.	PUNCT
ap-1682	246	1	the	the	DET
ap-1682	246	2	global	global	ADJ
ap-1682	246	3	optimum	optimum	NOUN
ap-1682	246	4	was	be	AUX
ap-1682	246	5	gained	gain	VERB
ap-1682	246	6	in	in	ADP
ap-1682	246	7	the	the	DET
ap-1682	246	8	66th	66th	ADJ
ap-1682	246	9	iteration	iteration	NOUN
ap-1682	246	10	.	.	PUNCT
ap-1682	247	1	nevertheless	nevertheless	ADV
ap-1682	247	2	,	,	PUNCT
ap-1682	247	3	it	it	PRON
ap-1682	247	4	should	should	AUX
ap-1682	247	5	be	be	AUX
ap-1682	247	6	pointed	point	VERB
ap-1682	247	7	out	out	ADP
ap-1682	247	8	that	that	SCONJ
ap-1682	247	9	the	the	DET
ap-1682	247	10	number	number	NOUN
ap-1682	247	11	of	of	ADP
ap-1682	247	12	iterations	iteration	NOUN
ap-1682	247	13	depends	depend	VERB
ap-1682	247	14	strictly	strictly	ADV
ap-1682	247	15	on	on	ADP
ap-1682	247	16	the	the	DET
ap-1682	247	17	data	data	NOUN
ap-1682	247	18	ordering	ordering	NOUN
ap-1682	247	19	or	or	CCONJ
ap-1682	247	20	the	the	DET
ap-1682	247	21	starting	starting	NOUN
ap-1682	247	22	point	point	NOUN
ap-1682	247	23	(	(	PUNCT
ap-1682	247	24	minimum	minimum	NOUN
ap-1682	247	25	vs	vs	ADP
ap-1682	247	26	maximum	maximum	ADJ
ap-1682	247	27	cross	cross	ADJ
ap-1682	247	28	-	-	ADJ
ap-1682	247	29	sectional	sectional	ADJ
ap-1682	247	30	areas	area	NOUN
ap-1682	247	31	)	)	PUNCT
ap-1682	247	32	.	.	PUNCT
ap-1682	248	1	since	since	SCONJ
ap-1682	248	2	the	the	DET
ap-1682	248	3	task	task	NOUN
ap-1682	248	4	is	be	AUX
ap-1682	248	5	to	to	PART
ap-1682	248	6	find	find	VERB
ap-1682	248	7	the	the	DET
ap-1682	248	8	global	global	ADJ
ap-1682	248	9	optima	optima	PROPN
ap-1682	248	10	,	,	PUNCT
ap-1682	248	11	the	the	DET
ap-1682	248	12	whole	whole	ADJ
ap-1682	248	13	subspace	subspace	NOUN
ap-1682	248	14	of	of	ADP
ap-1682	248	15	potential	potential	ADJ
ap-1682	248	16	solutions	solution	NOUN
ap-1682	248	17	must	must	AUX
ap-1682	248	18	be	be	AUX
ap-1682	248	19	searched	search	VERB
ap-1682	248	20	for	for	ADP
ap-1682	248	21	,	,	PUNCT
ap-1682	248	22	and	and	CCONJ
ap-1682	248	23	it	it	PRON
ap-1682	248	24	is	be	AUX
ap-1682	248	25	not	not	PART
ap-1682	248	26	possible	possible	ADJ
ap-1682	248	27	to	to	PART
ap-1682	248	28	shorten	shorten	VERB
ap-1682	248	29	the	the	DET
ap-1682	248	30	computation	computation	NOUN
ap-1682	248	31	.	.	PUNCT
ap-1682	249	1	in	in	ADP
ap-1682	249	2	tab	tab	PROPN
ap-1682	249	3	.	.	PUNCT
ap-1682	250	1	5	5	NUM
ap-1682	250	2	,	,	PUNCT
ap-1682	250	3	we	we	PRON
ap-1682	250	4	compare	compare	VERB
ap-1682	250	5	the	the	DET
ap-1682	250	6	optima	optima	NOUN
ap-1682	250	7	obtained	obtain	VERB
ap-1682	250	8	with	with	ADP
ap-1682	250	9	the	the	DET
ap-1682	250	10	branch	branch	NOUN
ap-1682	250	11	and	and	CCONJ
ap-1682	250	12	bound	bind	VERB
ap-1682	250	13	method	method	NOUN
ap-1682	250	14	with	with	ADP
ap-1682	250	15	the	the	DET
ap-1682	250	16	heuristic	heuristic	ADJ
ap-1682	250	17	algorithms	algorithm	NOUN
ap-1682	250	18	found	find	VERB
ap-1682	250	19	in	in	ADP
ap-1682	250	20	the	the	DET
ap-1682	250	21	literature	literature	NOUN
ap-1682	250	22	.	.	PUNCT
ap-1682	251	1	the	the	DET
ap-1682	251	2	result	result	NOUN
ap-1682	251	3	of	of	ADP
ap-1682	251	4	the	the	DET
ap-1682	251	5	branch	branch	NOUN
ap-1682	251	6	and	and	CCONJ
ap-1682	251	7	bound	bind	VERB
ap-1682	251	8	method	method	NOUN
ap-1682	251	9	(	(	PUNCT
ap-1682	251	10	b&b	b&b	PROPN
ap-1682	251	11	)	)	PUNCT
ap-1682	251	12	is	be	AUX
ap-1682	251	13	identical	identical	ADJ
ap-1682	251	14	to	to	ADP
ap-1682	251	15	the	the	DET
ap-1682	251	16	1it	1it	NOUN
ap-1682	251	17	was	be	AUX
ap-1682	251	18	not	not	PART
ap-1682	251	19	necessary	necessary	ADJ
ap-1682	251	20	to	to	PART
ap-1682	251	21	compute	compute	VERB
ap-1682	251	22	the	the	DET
ap-1682	251	23	whole	whole	ADJ
ap-1682	251	24	task	task	NOUN
ap-1682	251	25	.	.	PUNCT
ap-1682	252	1	some	some	DET
ap-1682	252	2	variables	variable	NOUN
ap-1682	252	3	were	be	AUX
ap-1682	252	4	fixed	fix	VERB
ap-1682	252	5	to	to	ADP
ap-1682	252	6	prescribed	prescribed	ADJ
ap-1682	252	7	values	value	NOUN
ap-1682	252	8	,	,	PUNCT
ap-1682	252	9	here	here	ADV
ap-1682	252	10	2	2	NUM
ap-1682	252	11	out	out	ADP
ap-1682	252	12	of	of	ADP
ap-1682	252	13	8	8	NUM
ap-1682	252	14	variables	variable	NOUN
ap-1682	252	15	,	,	PUNCT
ap-1682	252	16	and	and	CCONJ
ap-1682	252	17	the	the	DET
ap-1682	252	18	algorithm	algorithm	NOUN
ap-1682	252	19	was	be	AUX
ap-1682	252	20	run	run	VERB
ap-1682	252	21	with	with	ADP
ap-1682	252	22	this	this	DET
ap-1682	252	23	restriction	restriction	NOUN
ap-1682	252	24	.	.	PUNCT
ap-1682	253	1	solution	solution	NOUN
ap-1682	253	2	presented	present	VERB
ap-1682	253	3	by	by	ADP
ap-1682	253	4	kripka	kripka	PROPN
ap-1682	253	5	[	[	X
ap-1682	253	6	15	15	NUM
ap-1682	253	7	]	]	PUNCT
ap-1682	253	8	using	use	VERB
ap-1682	253	9	the	the	DET
ap-1682	253	10	simulated	simulate	VERB
ap-1682	253	11	annealing	annealing	NOUN
ap-1682	253	12	method	method	NOUN
ap-1682	253	13	(	(	PUNCT
ap-1682	253	14	sa	sa	NOUN
ap-1682	253	15	)	)	PUNCT
ap-1682	253	16	.	.	PUNCT
ap-1682	254	1	however	however	ADV
ap-1682	254	2	,	,	PUNCT
ap-1682	254	3	he	he	PRON
ap-1682	254	4	did	do	AUX
ap-1682	254	5	not	not	PART
ap-1682	254	6	search	search	VERB
ap-1682	254	7	the	the	DET
ap-1682	254	8	whole	whole	ADJ
ap-1682	254	9	subspace	subspace	NOUN
ap-1682	254	10	of	of	ADP
ap-1682	254	11	possible	possible	ADJ
ap-1682	254	12	solutions	solution	NOUN
ap-1682	254	13	,	,	PUNCT
ap-1682	254	14	so	so	SCONJ
ap-1682	254	15	he	he	PRON
ap-1682	254	16	could	could	AUX
ap-1682	254	17	not	not	PART
ap-1682	254	18	be	be	AUX
ap-1682	254	19	sure	sure	ADJ
ap-1682	254	20	that	that	SCONJ
ap-1682	254	21	the	the	DET
ap-1682	254	22	obtained	obtain	VERB
ap-1682	254	23	optimum	optimum	NOUN
ap-1682	254	24	is	be	AUX
ap-1682	254	25	the	the	DET
ap-1682	254	26	global	global	ADJ
ap-1682	254	27	one	one	NUM
ap-1682	254	28	.	.	PUNCT
ap-1682	255	1	to	to	ADP
ap-1682	255	2	the	the	DET
ap-1682	255	3	best	good	ADJ
ap-1682	255	4	of	of	ADP
ap-1682	255	5	the	the	DET
ap-1682	255	6	authors	author	NOUN
ap-1682	255	7	’	’	PART
ap-1682	255	8	knowledge	knowledge	NOUN
ap-1682	255	9	,	,	PUNCT
ap-1682	255	10	global	global	ADJ
ap-1682	255	11	optima	optima	NOUN
ap-1682	255	12	for	for	ADP
ap-1682	255	13	computationally	computationally	ADV
ap-1682	255	14	demanding	demand	VERB
ap-1682	255	15	tasks	task	NOUN
ap-1682	255	16	such	such	ADJ
ap-1682	255	17	as	as	ADP
ap-1682	255	18	the	the	DET
ap-1682	255	19	25	25	NUM
ap-1682	255	20	-	-	PUNCT
ap-1682	255	21	bar	bar	NOUN
ap-1682	255	22	truss	truss	NOUN
ap-1682	255	23	problem	problem	NOUN
ap-1682	255	24	have	have	AUX
ap-1682	255	25	not	not	PART
ap-1682	255	26	been	be	AUX
ap-1682	255	27	published	publish	VERB
ap-1682	255	28	yet	yet	ADV
ap-1682	255	29	.	.	PUNCT
ap-1682	256	1	we	we	PRON
ap-1682	256	2	hope	hope	VERB
ap-1682	256	3	that	that	SCONJ
ap-1682	256	4	by	by	ADP
ap-1682	256	5	publishing	publish	VERB
ap-1682	256	6	the	the	DET
ap-1682	256	7	algorithm	algorithm	NOUN
ap-1682	256	8	as	as	ADV
ap-1682	256	9	well	well	ADV
ap-1682	256	10	as	as	ADP
ap-1682	256	11	the	the	DET
ap-1682	256	12	value	value	NOUN
ap-1682	256	13	of	of	ADP
ap-1682	256	14	the	the	DET
ap-1682	256	15	global	global	ADJ
ap-1682	256	16	optimum	optimum	NOUN
ap-1682	256	17	we	we	PRON
ap-1682	256	18	will	will	AUX
ap-1682	256	19	introduce	introduce	VERB
ap-1682	256	20	a	a	DET
ap-1682	256	21	quality	quality	NOUN
ap-1682	256	22	standard	standard	NOUN
ap-1682	256	23	that	that	PRON
ap-1682	256	24	will	will	AUX
ap-1682	256	25	help	help	VERB
ap-1682	256	26	to	to	PART
ap-1682	256	27	improve	improve	VERB
ap-1682	256	28	new	new	ADJ
ap-1682	256	29	optimization	optimization	NOUN
ap-1682	256	30	methods	method	NOUN
ap-1682	256	31	.	.	PUNCT
ap-1682	257	1	acknowledgements	acknowledgement	NOUN
ap-1682	257	2	this	this	DET
ap-1682	257	3	work	work	NOUN
ap-1682	257	4	was	be	AUX
ap-1682	257	5	supported	support	VERB
ap-1682	257	6	by	by	ADP
ap-1682	257	7	the	the	DET
ap-1682	257	8	grant	grant	PROPN
ap-1682	257	9	agency	agency	NOUN
ap-1682	257	10	of	of	ADP
ap-1682	257	11	the	the	DET
ap-1682	257	12	czech	czech	PROPN
ap-1682	257	13	technical	technical	PROPN
ap-1682	257	14	university	university	PROPN
ap-1682	257	15	in	in	ADP
ap-1682	257	16	prague	prague	PROPN
ap-1682	257	17	,	,	PUNCT
ap-1682	257	18	grants	grant	VERB
ap-1682	257	19	number	number	NOUN
ap-1682	257	20	sgs11/021	sgs11/021	NOUN
ap-1682	257	21	/	/	SYM
ap-1682	257	22	ohk1/1t/11	ohk1/1t/11	PROPN
ap-1682	257	23	and	and	CCONJ
ap-1682	257	24	number	number	NOUN
ap-1682	257	25	sgs12/027	sgs12/027	NOUN
ap-1682	257	26	/	/	SYM
ap-1682	257	27	ohk1/1t/11	ohk1/1t/11	PROPN
ap-1682	257	28	,	,	PUNCT
ap-1682	257	29	the	the	DET
ap-1682	257	30	czech	czech	PROPN
ap-1682	257	31	science	science	PROPN
ap-1682	257	32	foundation	foundation	PROPN
ap-1682	257	33	gacr	gacr	PROPN
ap-1682	257	34	,	,	PUNCT
ap-1682	257	35	grant	grant	VERB
ap-1682	257	36	number	number	NOUN
ap-1682	257	37	p105/12/1146	p105/12/1146	NOUN
ap-1682	257	38	and	and	CCONJ
ap-1682	257	39	by	by	ADP
ap-1682	257	40	ministry	ministry	PROPN
ap-1682	257	41	of	of	ADP
ap-1682	257	42	education	education	PROPN
ap-1682	257	43	,	,	PUNCT
ap-1682	257	44	youth	youth	NOUN
ap-1682	257	45	and	and	CCONJ
ap-1682	257	46	sports	sport	NOUN
ap-1682	257	47	,	,	PUNCT
ap-1682	257	48	grant	grant	NOUN
ap-1682	257	49	number	number	NOUN
ap-1682	257	50	msm	msm	NOUN
ap-1682	257	51	6840770003	6840770003	NUM
ap-1682	257	52	.	.	PUNCT
ap-1682	258	1	references	reference	NOUN
ap-1682	258	2	[	[	X
ap-1682	258	3	1	1	NUM
ap-1682	258	4	]	]	X
ap-1682	258	5	shewchuk	shewchuk	PROPN
ap-1682	258	6	,	,	PUNCT
ap-1682	258	7	j.	j.	PROPN
ap-1682	258	8	r.	r.	PROPN
ap-1682	258	9	:	:	PUNCT
ap-1682	258	10	an	an	DET
ap-1682	258	11	introduction	introduction	NOUN
ap-1682	258	12	to	to	ADP
ap-1682	258	13	the	the	DET
ap-1682	258	14	conjugate	conjugate	ADJ
ap-1682	258	15	gradient	gradient	NOUN
ap-1682	258	16	method	method	NOUN
ap-1682	258	17	without	without	ADP
ap-1682	258	18	the	the	DET
ap-1682	258	19	agonizing	agonizing	ADJ
ap-1682	258	20	pain	pain	NOUN
ap-1682	258	21	,	,	PUNCT
ap-1682	258	22	school	school	NOUN
ap-1682	258	23	of	of	ADP
ap-1682	258	24	computer	computer	NOUN
ap-1682	258	25	science	science	NOUN
ap-1682	258	26	,	,	PUNCT
ap-1682	258	27	carnegie	carnegie	PROPN
ap-1682	258	28	mellon	mellon	PROPN
ap-1682	258	29	univ	univ	PROPN
ap-1682	258	30	.	.	PROPN
ap-1682	258	31	,	,	PUNCT
ap-1682	258	32	pittsburgh	pittsburgh	PROPN
ap-1682	258	33	,	,	PUNCT
ap-1682	259	1	[	[	X
ap-1682	259	2	online	online	X
ap-1682	259	3	]	]	X
ap-1682	259	4	,	,	PUNCT
ap-1682	259	5	1994	1994	NUM
ap-1682	259	6	.	.	PUNCT
ap-1682	260	1	[	[	X
ap-1682	260	2	2	2	NUM
ap-1682	260	3	]	]	PUNCT
ap-1682	260	4	eiben	eiben	NOUN
ap-1682	260	5	,	,	PUNCT
ap-1682	260	6	a.	a.	PROPN
ap-1682	260	7	e.	e.	PROPN
ap-1682	260	8	,	,	PUNCT
ap-1682	260	9	smith	smith	PROPN
ap-1682	260	10	,	,	PUNCT
ap-1682	260	11	j.	j.	PROPN
ap-1682	260	12	e.	e.	PROPN
ap-1682	260	13	:	:	PUNCT
ap-1682	260	14	introduction	introduction	NOUN
ap-1682	260	15	to	to	ADP
ap-1682	260	16	evolutionary	evolutionary	ADJ
ap-1682	260	17	computing	computing	NOUN
ap-1682	260	18	,	,	PUNCT
ap-1682	260	19	berlin	berlin	PROPN
ap-1682	260	20	:	:	PUNCT
ap-1682	260	21	springer	springer	NOUN
ap-1682	260	22	,	,	PUNCT
ap-1682	260	23	2003	2003	NUM
ap-1682	260	24	.	.	PUNCT
ap-1682	261	1	[	[	X
ap-1682	261	2	3	3	NUM
ap-1682	261	3	]	]	X
ap-1682	261	4	bendsoe	bendsoe	PROPN
ap-1682	261	5	,	,	PUNCT
ap-1682	261	6	m.	m.	NOUN
ap-1682	261	7	p.	p.	PROPN
ap-1682	261	8	,	,	PUNCT
ap-1682	261	9	sigmund	sigmund	PROPN
ap-1682	261	10	o.	o.	NOUN
ap-1682	261	11	:	:	PUNCT
ap-1682	261	12	topology	topology	NOUN
ap-1682	261	13	optimization	optimization	NOUN
ap-1682	261	14	:	:	PUNCT
ap-1682	261	15	theory	theory	NOUN
ap-1682	261	16	,	,	PUNCT
ap-1682	261	17	methods	method	NOUN
ap-1682	261	18	and	and	CCONJ
ap-1682	261	19	applications	application	NOUN
ap-1682	261	20	,	,	PUNCT
ap-1682	261	21	berlin	berlin	PROPN
ap-1682	261	22	:	:	PUNCT
ap-1682	261	23	springer	springer	NOUN
ap-1682	261	24	,	,	PUNCT
ap-1682	261	25	2003	2003	NUM
ap-1682	261	26	.	.	PUNCT
ap-1682	262	1	[	[	X
ap-1682	262	2	4	4	NUM
ap-1682	262	3	]	]	X
ap-1682	262	4	land	land	NOUN
ap-1682	262	5	,	,	PUNCT
ap-1682	262	6	a.	a.	PROPN
ap-1682	262	7	h.	h.	PROPN
ap-1682	262	8	,	,	PUNCT
ap-1682	262	9	doig	doig	PROPN
ap-1682	262	10	a.	a.	PROPN
ap-1682	262	11	g.	g.	PROPN
ap-1682	262	12	:	:	PUNCT
ap-1682	262	13	“	"	PUNCT
ap-1682	262	14	an	an	DET
ap-1682	262	15	automatic	automatic	ADJ
ap-1682	262	16	method	method	NOUN
ap-1682	262	17	of	of	ADP
ap-1682	262	18	solving	solve	VERB
ap-1682	262	19	discrete	discrete	ADJ
ap-1682	262	20	programming	programming	NOUN
ap-1682	262	21	problems	problem	NOUN
ap-1682	262	22	.	.	PUNCT
ap-1682	262	23	”	"	PUNCT
ap-1682	263	1	econometrica	econometrica	PROPN
ap-1682	263	2	,	,	PUNCT
ap-1682	263	3	28	28	NUM
ap-1682	263	4	(	(	PUNCT
ap-1682	263	5	3	3	NUM
ap-1682	263	6	)	)	PUNCT
ap-1682	263	7	,	,	PUNCT
ap-1682	263	8	1960	1960	NUM
ap-1682	263	9	,	,	PUNCT
ap-1682	263	10	pp	pp	ADP
ap-1682	263	11	.	.	PUNCT
ap-1682	264	1	497–520	497–520	NUM
ap-1682	264	2	.	.	PUNCT
ap-1682	265	1	[	[	X
ap-1682	265	2	5	5	NUM
ap-1682	265	3	]	]	X
ap-1682	265	4	arora	arora	PROPN
ap-1682	265	5	,	,	PUNCT
ap-1682	265	6	j.	j.	PROPN
ap-1682	265	7	s.	s.	PROPN
ap-1682	265	8	:	:	PUNCT
ap-1682	265	9	methods	method	NOUN
ap-1682	265	10	for	for	ADP
ap-1682	265	11	discrete	discrete	ADJ
ap-1682	265	12	variable	variable	ADJ
ap-1682	265	13	structural	structural	ADJ
ap-1682	265	14	optimization	optimization	NOUN
ap-1682	265	15	.	.	PUNCT
ap-1682	266	1	in	in	ADP
ap-1682	266	2	:	:	PUNCT
ap-1682	266	3	“	"	PUNCT
ap-1682	266	4	recent	recent	ADJ
ap-1682	266	5	advantages	advantage	NOUN
ap-1682	266	6	in	in	ADP
ap-1682	266	7	optimal	optimal	ADJ
ap-1682	266	8	structural	structural	ADJ
ap-1682	266	9	design	design	NOUN
ap-1682	266	10	”	"	PUNCT
ap-1682	266	11	.	.	PUNCT
ap-1682	267	1	american	american	ADJ
ap-1682	267	2	society	society	NOUN
ap-1682	267	3	of	of	ADP
ap-1682	267	4	civil	civil	ADJ
ap-1682	267	5	engineers	engineer	NOUN
ap-1682	267	6	,	,	PUNCT
ap-1682	267	7	2002	2002	NUM
ap-1682	267	8	,	,	PUNCT
ap-1682	267	9	p.	p.	NOUN
ap-1682	267	10	1–40	1–40	NUM
ap-1682	267	11	.	.	PUNCT
ap-1682	268	1	[	[	X
ap-1682	268	2	6	6	NUM
ap-1682	268	3	]	]	PUNCT
ap-1682	268	4	the	the	DET
ap-1682	268	5	mathworks	mathworks	PROPN
ap-1682	268	6	,	,	PUNCT
ap-1682	268	7	find	find	VERB
ap-1682	268	8	minimum	minimum	NOUN
ap-1682	268	9	of	of	ADP
ap-1682	268	10	constrained	constrain	VERB
ap-1682	268	11	nonlinear	nonlinear	ADJ
ap-1682	268	12	multivariable	multivariable	ADJ
ap-1682	268	13	function	function	NOUN
ap-1682	268	14	matlab	matlab	PROPN
ap-1682	268	15	.	.	PUNCT
ap-1682	269	1	[	[	X
ap-1682	269	2	02/10/2011	02/10/2011	NUM
ap-1682	269	3	]	]	X
ap-1682	269	4	.	.	PUNCT
ap-1682	269	5	http://www.mathworks.com/	http://www.mathworks.com/	PROPN
ap-1682	270	1	[	[	X
ap-1682	270	2	7	7	NUM
ap-1682	270	3	]	]	X
ap-1682	270	4	bhatti	bhatti	PROPN
ap-1682	270	5	,	,	PUNCT
ap-1682	270	6	m.	m.	NOUN
ap-1682	270	7	a.	a.	NOUN
ap-1682	270	8	:	:	PUNCT
ap-1682	270	9	practical	practical	ADJ
ap-1682	270	10	optimization	optimization	NOUN
ap-1682	270	11	methods	method	NOUN
ap-1682	270	12	,	,	PUNCT
ap-1682	270	13	new	new	PROPN
ap-1682	270	14	york	york	PROPN
ap-1682	270	15	:	:	PUNCT
ap-1682	270	16	springer	springer	NOUN
ap-1682	270	17	-	-	PUNCT
ap-1682	270	18	verlag	verlag	PROPN
ap-1682	270	19	,	,	PUNCT
ap-1682	270	20	2000	2000	NUM
ap-1682	270	21	.	.	PUNCT
ap-1682	271	1	[	[	X
ap-1682	271	2	8	8	X
ap-1682	271	3	]	]	X
ap-1682	271	4	the	the	DET
ap-1682	271	5	mathworks	mathworks	PROPN
ap-1682	271	6	,	,	PUNCT
ap-1682	271	7	constrained	constrain	VERB
ap-1682	271	8	nonlinear	nonlinear	ADJ
ap-1682	271	9	optimization	optimization	NOUN
ap-1682	271	10	algorithms	algorithm	NOUN
ap-1682	271	11	:	:	PUNCT
ap-1682	271	12	optimization	optimization	NOUN
ap-1682	271	13	algorithms	algorithm	NOUN
ap-1682	271	14	and	and	CCONJ
ap-1682	271	15	examples	example	NOUN
ap-1682	271	16	.	.	PUNCT
ap-1682	272	1	[	[	X
ap-1682	272	2	02/10/2011	02/10/2011	NUM
ap-1682	272	3	]	]	X
ap-1682	272	4	.	.	PUNCT
ap-1682	272	5	http://www.mathworks.com/	http://www.mathworks.com/	PROPN
ap-1682	272	6	80	80	NUM
ap-1682	272	7	acta	acta	PROPN
ap-1682	272	8	polytechnica	polytechnica	PROPN
ap-1682	272	9	vol	vol	NOUN
ap-1682	272	10	.	.	PROPN
ap-1682	273	1	52	52	NUM
ap-1682	273	2	no	no	NOUN
ap-1682	273	3	.	.	PUNCT
ap-1682	274	1	6/2012	6/2012	NUM
ap-1682	274	2	variable	variable	ADJ
ap-1682	274	3	units	unit	NOUN
ap-1682	274	4	this	this	DET
ap-1682	274	5	paper	paper	NOUN
ap-1682	274	6	kripka	kripka	NOUN
ap-1682	274	7	lemonge	lemonge	PROPN
ap-1682	274	8	&	&	CCONJ
ap-1682	274	9	barbosa	barbosa	PROPN
ap-1682	274	10	li	li	PROPN
ap-1682	274	11	&	&	CCONJ
ap-1682	274	12	liu	liu	PROPN
ap-1682	274	13	wu	wu	PROPN
ap-1682	274	14	&	&	CCONJ
ap-1682	274	15	chow	chow	PROPN
ap-1682	274	16	coello	coello	PROPN
ap-1682	274	17	rajeev	rajeev	PROPN
ap-1682	274	18	&	&	CCONJ
ap-1682	274	19	krishnamoorthy	krishnamoorthy	PROPN
ap-1682	274	20	[	[	X
ap-1682	274	21	15	15	NUM
ap-1682	274	22	]	]	X
ap-1682	275	1	[	[	X
ap-1682	275	2	16	16	NUM
ap-1682	275	3	]	]	X
ap-1682	276	1	[	[	X
ap-1682	276	2	17	17	NUM
ap-1682	276	3	]	]	X
ap-1682	277	1	[	[	X
ap-1682	277	2	11	11	NUM
ap-1682	277	3	]	]	X
ap-1682	277	4	[	[	X
ap-1682	277	5	18	18	NUM
ap-1682	277	6	]	]	X
ap-1682	277	7	[	[	X
ap-1682	277	8	12	12	NUM
ap-1682	277	9	]	]	PUNCT
ap-1682	277	10	b&b	b&b	PROPN
ap-1682	277	11	sa	sa	PROPN
ap-1682	277	12	ga	ga	PROPN
ap-1682	277	13	pso	pso	PROPN
ap-1682	277	14	ga	ga	PROPN
ap-1682	277	15	ga	ga	PROPN
ap-1682	277	16	ga	ga	PROPN
ap-1682	277	17	date	date	PROPN
ap-1682	277	18	2012	2012	NUM
ap-1682	277	19	2004	2004	NUM
ap-1682	277	20	2004	2004	NUM
ap-1682	277	21	2009	2009	NUM
ap-1682	277	22	1995	1995	NUM
ap-1682	277	23	1994	1994	NUM
ap-1682	277	24	1992	1992	NUM
ap-1682	277	25	a1	a1	NOUN
ap-1682	277	26	in2	in2	PROPN
ap-1682	277	27	0.1	0.1	NUM
ap-1682	278	1	0.1	0.1	NUM
ap-1682	278	2	0.1	0.1	NUM
ap-1682	278	3	0.1	0.1	NUM
ap-1682	278	4	0.1	0.1	NUM
ap-1682	278	5	1.5	1.5	NUM
ap-1682	278	6	0.1	0.1	NUM
ap-1682	278	7	a2	a2	PROPN
ap-1682	278	8	in2	in2	PROPN
ap-1682	278	9	0.4	0.4	NUM
ap-1682	278	10	0.4	0.4	NUM
ap-1682	278	11	0.3	0.3	NUM
ap-1682	278	12	0.3	0.3	NUM
ap-1682	278	13	0.5	0.5	NUM
ap-1682	278	14	0.7	0.7	NUM
ap-1682	278	15	1.8	1.8	NUM
ap-1682	278	16	a3	a3	NOUN
ap-1682	278	17	in2	in2	PROPN
ap-1682	278	18	3.4	3.4	NUM
ap-1682	278	19	3.4	3.4	NUM
ap-1682	278	20	3.4	3.4	NUM
ap-1682	278	21	3.4	3.4	NUM
ap-1682	278	22	3.4	3.4	NUM
ap-1682	278	23	3.4	3.4	NUM
ap-1682	278	24	2.3	2.3	NUM
ap-1682	278	25	a4	a4	NOUN
ap-1682	278	26	in2	in2	PROPN
ap-1682	278	27	0.1	0.1	NUM
ap-1682	278	28	0.1	0.1	NUM
ap-1682	278	29	0.1	0.1	NUM
ap-1682	278	30	0.1	0.1	NUM
ap-1682	278	31	0.1	0.1	NUM
ap-1682	278	32	0.7	0.7	NUM
ap-1682	278	33	0.2	0.2	NUM
ap-1682	278	34	a5	a5	PROPN
ap-1682	278	35	in2	in2	PROPN
ap-1682	278	36	2.2	2.2	NUM
ap-1682	279	1	2.2	2.2	NUM
ap-1682	279	2	2.1	2.1	NUM
ap-1682	279	3	2.1	2.1	NUM
ap-1682	279	4	1.5	1.5	NUM
ap-1682	279	5	0.4	0.4	NUM
ap-1682	279	6	0.1	0.1	NUM
ap-1682	279	7	a6	a6	NOUN
ap-1682	279	8	in2	in2	PROPN
ap-1682	279	9	1	1	NUM
ap-1682	279	10	1	1	NUM
ap-1682	279	11	1	1	NUM
ap-1682	279	12	1	1	NUM
ap-1682	279	13	0.9	0.9	NUM
ap-1682	279	14	0.7	0.7	NUM
ap-1682	279	15	0.8	0.8	NUM
ap-1682	279	16	a7	a7	ADJ
ap-1682	279	17	in2	in2	PROPN
ap-1682	279	18	0.4	0.4	NUM
ap-1682	279	19	0.4	0.4	NUM
ap-1682	279	20	0.5	0.5	NUM
ap-1682	279	21	0.5	0.5	NUM
ap-1682	279	22	0.6	0.6	NUM
ap-1682	279	23	1.5	1.5	NUM
ap-1682	279	24	1.8	1.8	NUM
ap-1682	279	25	a8	a8	PROPN
ap-1682	279	26	in2	in2	PROPN
ap-1682	279	27	3.4	3.4	NUM
ap-1682	279	28	3.4	3.4	NUM
ap-1682	279	29	3.4	3.4	NUM
ap-1682	279	30	3.4	3.4	NUM
ap-1682	279	31	3.4	3.4	NUM
ap-1682	279	32	3.2	3.2	NUM
ap-1682	279	33	3	3	NUM
ap-1682	279	34	m	m	NOUN
ap-1682	279	35	lb	lb	ADP
ap-1682	279	36	484.33	484.33	NUM
ap-1682	279	37	484.33	484.33	NUM
ap-1682	279	38	484.85	484.85	NUM
ap-1682	279	39	484.85	484.85	NUM
ap-1682	279	40	486.29	486.29	NUM
ap-1682	279	41	539.78	539.78	NUM
ap-1682	279	42	546.01	546.01	NUM
ap-1682	279	43	max	max	PROPN
ap-1682	279	44	|σi|	|σi|	PROPN
ap-1682	279	45	ksi	ksi	PROPN
ap-1682	279	46	6.20	6.20	NUM
ap-1682	279	47	6.20	6.20	NUM
ap-1682	279	48	6.11	6.11	NUM
ap-1682	279	49	6.11	6.11	NUM
ap-1682	279	50	6.01	6.01	NUM
ap-1682	279	51	6.66	6.66	NUM
ap-1682	279	52	6.77	6.77	NUM
ap-1682	279	53	max	max	NOUN
ap-1682	279	54	|wj	|wj	X
ap-1682	279	55	|	|	ADV
ap-1682	279	56	in	in	ADP
ap-1682	279	57	0.35	0.35	NUM
ap-1682	279	58	0.35	0.35	NUM
ap-1682	279	59	0.35	0.35	NUM
ap-1682	279	60	0.35	0.35	NUM
ap-1682	279	61	0.35	0.35	NUM
ap-1682	279	62	0.34	0.34	NUM
ap-1682	279	63	0.35	0.35	NUM
ap-1682	279	64	table	table	NOUN
ap-1682	279	65	5	5	NUM
ap-1682	279	66	:	:	PUNCT
ap-1682	279	67	a	a	DET
ap-1682	279	68	comparison	comparison	NOUN
ap-1682	279	69	of	of	ADP
ap-1682	279	70	results	result	NOUN
ap-1682	279	71	for	for	ADP
ap-1682	279	72	the	the	DET
ap-1682	279	73	25	25	NUM
ap-1682	279	74	-	-	PUNCT
ap-1682	279	75	bar	bar	NOUN
ap-1682	279	76	truss	truss	NOUN
ap-1682	279	77	,	,	PUNCT
ap-1682	279	78	discrete	discrete	ADJ
ap-1682	279	79	case	case	NOUN
ap-1682	279	80	,	,	PUNCT
ap-1682	279	81	from	from	ADP
ap-1682	279	82	the	the	DET
ap-1682	279	83	literature	literature	NOUN
ap-1682	279	84	and	and	CCONJ
ap-1682	279	85	from	from	ADP
ap-1682	279	86	our	our	PRON
ap-1682	279	87	work	work	NOUN
ap-1682	279	88	.	.	PUNCT
ap-1682	280	1	b&b	b&b	PROPN
ap-1682	280	2	—	—	PUNCT
ap-1682	280	3	method	method	NOUN
ap-1682	280	4	based	base	VERB
ap-1682	280	5	on	on	ADP
ap-1682	280	6	branch	branch	NOUN
ap-1682	280	7	and	and	CCONJ
ap-1682	280	8	bound	bind	VERB
ap-1682	280	9	principles	principle	NOUN
ap-1682	280	10	,	,	PUNCT
ap-1682	280	11	sa	sa	PROPN
ap-1682	280	12	—	—	PUNCT
ap-1682	280	13	simulated	simulate	VERB
ap-1682	280	14	annealing	annealing	NOUN
ap-1682	280	15	,	,	PUNCT
ap-1682	280	16	ga	ga	NOUN
ap-1682	280	17	—	—	PUNCT
ap-1682	280	18	genetic	genetic	ADJ
ap-1682	280	19	algorithm	algorithm	NOUN
ap-1682	280	20	,	,	PUNCT
ap-1682	280	21	pso	pso	NOUN
ap-1682	280	22	—	—	PUNCT
ap-1682	280	23	particle	particle	NOUN
ap-1682	280	24	swarm	swarm	NOUN
ap-1682	280	25	optimization	optimization	NOUN
ap-1682	280	26	.	.	PUNCT
ap-1682	281	1	σlim	σlim	PROPN
ap-1682	281	2	=	=	SYM
ap-1682	281	3	40	40	NUM
ap-1682	281	4	ksi	ksi	NOUN
ap-1682	281	5	,	,	PUNCT
ap-1682	281	6	wlim	wlim	NOUN
ap-1682	281	7	=	=	SYM
ap-1682	281	8	0.35	0.35	NUM
ap-1682	281	9	in	in	ADV
ap-1682	281	10	.	.	PUNCT
ap-1682	282	1	[	[	X
ap-1682	282	2	9	9	X
ap-1682	282	3	]	]	X
ap-1682	282	4	pospíšilová	pospíšilová	PROPN
ap-1682	282	5	a.	a.	NOUN
ap-1682	282	6	:	:	PUNCT
ap-1682	282	7	analysis	analysis	NOUN
ap-1682	282	8	of	of	ADP
ap-1682	282	9	sizing	size	VERB
ap-1682	282	10	optimization	optimization	NOUN
ap-1682	282	11	benchmarks	benchmark	NOUN
ap-1682	282	12	,	,	PUNCT
ap-1682	282	13	bachelor	bachelor	NOUN
ap-1682	282	14	thesis	thesis	NOUN
ap-1682	282	15	,	,	PUNCT
ap-1682	282	16	ctu	ctu	NOUN
ap-1682	282	17	in	in	ADP
ap-1682	282	18	prague	prague	PROPN
ap-1682	282	19	,	,	PUNCT
ap-1682	282	20	2010	2010	NUM
ap-1682	282	21	.	.	PUNCT
ap-1682	283	1	http://klobouk.fsv.cvut.cz/	http://klobouk.fsv.cvut.cz/	PUNCT
ap-1682	283	2	~pospisilova	~pospisilova	PUNCT
ap-1682	283	3	/	/	SYM
ap-1682	283	4	publications	publication	NOUN
ap-1682	283	5	/	/	SYM
ap-1682	283	6	ap_bp_2010	ap_bp_2010	PROPN
ap-1682	283	7	.	.	PUNCT
ap-1682	284	1	pdf	pdf	PROPN
ap-1682	285	1	[	[	X
ap-1682	285	2	10	10	NUM
ap-1682	285	3	]	]	X
ap-1682	285	4	fox	fox	PROPN
ap-1682	285	5	,	,	PUNCT
ap-1682	285	6	r.	r.	PROPN
ap-1682	285	7	l.	l.	PROPN
ap-1682	285	8	,	,	PUNCT
ap-1682	285	9	schmit	schmit	PROPN
ap-1682	285	10	,	,	PUNCT
ap-1682	285	11	l.	l.	PROPN
ap-1682	285	12	a.	a.	PROPN
ap-1682	285	13	jr	jr	PROPN
ap-1682	285	14	.	.	PROPN
ap-1682	285	15	:	:	PUNCT
ap-1682	285	16	“	"	PUNCT
ap-1682	285	17	advances	advance	NOUN
ap-1682	285	18	in	in	ADP
ap-1682	285	19	the	the	DET
ap-1682	285	20	integrated	integrate	VERB
ap-1682	285	21	approach	approach	NOUN
ap-1682	285	22	to	to	ADP
ap-1682	285	23	structural	structural	ADJ
ap-1682	285	24	synthesis	synthesis	NOUN
ap-1682	285	25	.	.	PUNCT
ap-1682	285	26	”	"	PUNCT
ap-1682	286	1	j	j	PROPN
ap-1682	286	2	spacecraft	spacecraft	NOUN
ap-1682	286	3	rockets	rocket	NOUN
ap-1682	286	4	,	,	PUNCT
ap-1682	286	5	3	3	NUM
ap-1682	286	6	(	(	PUNCT
ap-1682	286	7	6	6	NUM
ap-1682	286	8	)	)	PUNCT
ap-1682	286	9	,	,	PUNCT
ap-1682	286	10	1966	1966	NUM
ap-1682	286	11	,	,	PUNCT
ap-1682	286	12	p.	p.	NOUN
ap-1682	286	13	858–866	858–866	NUM
ap-1682	286	14	.	.	PUNCT
ap-1682	287	1	[	[	X
ap-1682	287	2	11	11	NUM
ap-1682	287	3	]	]	SYM
ap-1682	287	4	wu	wu	PROPN
ap-1682	287	5	,	,	PUNCT
ap-1682	287	6	s.-j	s.-j	PROPN
ap-1682	287	7	.	.	PROPN
ap-1682	287	8	,	,	PUNCT
ap-1682	287	9	chow	chow	PROPN
ap-1682	287	10	,	,	PUNCT
ap-1682	287	11	p.-t	p.-t	NOUN
ap-1682	287	12	.	.	PUNCT
ap-1682	287	13	:	:	PUNCT
ap-1682	287	14	“	"	PUNCT
ap-1682	287	15	steady	steady	ADJ
ap-1682	287	16	-	-	PUNCT
ap-1682	287	17	state	state	NOUN
ap-1682	287	18	genetic	genetic	ADJ
ap-1682	287	19	algorithms	algorithm	NOUN
ap-1682	287	20	for	for	ADP
ap-1682	287	21	discrete	discrete	ADJ
ap-1682	287	22	optimization	optimization	NOUN
ap-1682	287	23	of	of	ADP
ap-1682	287	24	trusses	truss	NOUN
ap-1682	287	25	.	.	PUNCT
ap-1682	287	26	”	"	PUNCT
ap-1682	288	1	comput	comput	NOUN
ap-1682	288	2	struct	struct	NOUN
ap-1682	288	3	,	,	PUNCT
ap-1682	288	4	56	56	NUM
ap-1682	288	5	(	(	PUNCT
ap-1682	288	6	6	6	NUM
ap-1682	288	7	)	)	PUNCT
ap-1682	288	8	,	,	PUNCT
ap-1682	288	9	1995	1995	NUM
ap-1682	288	10	,	,	PUNCT
ap-1682	288	11	p.	p.	NOUN
ap-1682	288	12	979–991	979–991	NUM
ap-1682	288	13	.	.	PUNCT
ap-1682	289	1	[	[	X
ap-1682	289	2	12	12	NUM
ap-1682	289	3	]	]	X
ap-1682	289	4	rajeev	rajeev	PROPN
ap-1682	289	5	,	,	PUNCT
ap-1682	289	6	s.	s.	PROPN
ap-1682	289	7	,	,	PUNCT
ap-1682	289	8	krishnamoorthy	krishnamoorthy	PROPN
ap-1682	289	9	,	,	PUNCT
ap-1682	289	10	c.	c.	PROPN
ap-1682	289	11	s.	s.	PROPN
ap-1682	289	12	:	:	PUNCT
ap-1682	289	13	“	"	PUNCT
ap-1682	289	14	discrete	discrete	ADJ
ap-1682	289	15	optimization	optimization	NOUN
ap-1682	289	16	of	of	ADP
ap-1682	289	17	structures	structure	NOUN
ap-1682	289	18	using	use	VERB
ap-1682	289	19	genetic	genetic	ADJ
ap-1682	289	20	algorithms	algorithm	NOUN
ap-1682	289	21	.	.	PUNCT
ap-1682	289	22	”	"	PUNCT
ap-1682	290	1	j	j	PROPN
ap-1682	290	2	struct	struct	NOUN
ap-1682	290	3	eng	eng	PROPN
ap-1682	290	4	,	,	PUNCT
ap-1682	290	5	118	118	NUM
ap-1682	290	6	(	(	PUNCT
ap-1682	290	7	5	5	NUM
ap-1682	290	8	)	)	PUNCT
ap-1682	290	9	,	,	PUNCT
ap-1682	290	10	1992	1992	NUM
ap-1682	290	11	,	,	PUNCT
ap-1682	290	12	p.	p.	NOUN
ap-1682	290	13	1233	1233	NUM
ap-1682	290	14	–	–	PUNCT
ap-1682	290	15	1250	1250	NUM
ap-1682	290	16	.	.	PUNCT
ap-1682	291	1	[	[	X
ap-1682	291	2	13	13	NUM
ap-1682	291	3	]	]	PUNCT
ap-1682	291	4	the	the	DET
ap-1682	291	5	mathworks	mathworks	PROPN
ap-1682	291	6	,	,	PUNCT
ap-1682	291	7	executing	execute	VERB
ap-1682	291	8	simultaneously	simultaneously	ADV
ap-1682	291	9	on	on	ADP
ap-1682	291	10	multiple	multiple	ADJ
ap-1682	291	11	data	datum	NOUN
ap-1682	291	12	sets	set	NOUN
ap-1682	291	13	:	:	PUNCT
ap-1682	291	14	single	single	ADJ
ap-1682	291	15	program	program	NOUN
ap-1682	291	16	multiple	multiple	ADJ
ap-1682	291	17	data	datum	NOUN
ap-1682	291	18	(	(	PUNCT
ap-1682	291	19	spmd	spmd	NOUN
ap-1682	291	20	)	)	PUNCT
ap-1682	291	21	.	.	PUNCT
ap-1682	292	1	[	[	X
ap-1682	292	2	02/10/2011	02/10/2011	NUM
ap-1682	292	3	]	]	X
ap-1682	292	4	.	.	PUNCT
ap-1682	292	5	http://www.mathworks.com/	http://www.mathworks.com/	PROPN
ap-1682	293	1	[	[	X
ap-1682	293	2	14	14	NUM
ap-1682	293	3	]	]	X
ap-1682	293	4	perez	perez	PROPN
ap-1682	293	5	,	,	PUNCT
ap-1682	293	6	r.	r.	PROPN
ap-1682	293	7	e.	e.	PROPN
ap-1682	293	8	,	,	PUNCT
ap-1682	293	9	behdinan	behdinan	PROPN
ap-1682	293	10	,	,	PUNCT
ap-1682	293	11	k.	k.	PROPN
ap-1682	293	12	:	:	PUNCT
ap-1682	293	13	particle	particle	NOUN
ap-1682	293	14	swarm	swarm	NOUN
ap-1682	293	15	optimization	optimization	NOUN
ap-1682	293	16	in	in	ADP
ap-1682	293	17	structural	structural	ADJ
ap-1682	293	18	design	design	NOUN
ap-1682	293	19	.	.	PUNCT
ap-1682	294	1	in	in	ADP
ap-1682	294	2	:	:	PUNCT
ap-1682	294	3	“	"	PUNCT
ap-1682	294	4	swarm	swarm	NOUN
ap-1682	294	5	intelligence	intelligence	NOUN
ap-1682	294	6	,	,	PUNCT
ap-1682	294	7	focus	focus	VERB
ap-1682	294	8	on	on	ADP
ap-1682	294	9	ant	ant	NOUN
ap-1682	294	10	and	and	CCONJ
ap-1682	294	11	particle	particle	NOUN
ap-1682	294	12	swarm	swarm	NOUN
ap-1682	294	13	optimization	optimization	NOUN
ap-1682	294	14	”	"	PUNCT
ap-1682	294	15	.	.	PUNCT
ap-1682	295	1	itech	itech	PROPN
ap-1682	295	2	education	education	PROPN
ap-1682	295	3	and	and	CCONJ
ap-1682	295	4	publishing	publishing	NOUN
ap-1682	295	5	,	,	PUNCT
ap-1682	295	6	2007	2007	NUM
ap-1682	295	7	,	,	PUNCT
ap-1682	295	8	p.	p.	NOUN
ap-1682	295	9	373–394	373–394	NUM
ap-1682	295	10	.	.	PUNCT
ap-1682	296	1	[	[	X
ap-1682	296	2	15	15	NUM
ap-1682	296	3	]	]	X
ap-1682	296	4	kripka	kripka	NOUN
ap-1682	296	5	,	,	PUNCT
ap-1682	296	6	m.	m.	NOUN
ap-1682	296	7	:	:	PUNCT
ap-1682	296	8	“	"	PUNCT
ap-1682	296	9	discrete	discrete	ADJ
ap-1682	296	10	optimization	optimization	NOUN
ap-1682	296	11	of	of	ADP
ap-1682	296	12	trusses	truss	NOUN
ap-1682	296	13	by	by	ADP
ap-1682	296	14	simulated	simulated	ADJ
ap-1682	296	15	annealing	annealing	NOUN
ap-1682	296	16	.	.	PUNCT
ap-1682	296	17	”	"	PUNCT
ap-1682	297	1	j	j	PROPN
ap-1682	297	2	braz	braz	PROPN
ap-1682	297	3	soc	soc	PROPN
ap-1682	297	4	mech	mech	PROPN
ap-1682	297	5	sci	sci	PROPN
ap-1682	297	6	eng	eng	PROPN
ap-1682	297	7	,	,	PUNCT
ap-1682	297	8	26	26	NUM
ap-1682	297	9	(	(	PUNCT
ap-1682	297	10	2	2	NUM
ap-1682	297	11	)	)	PUNCT
ap-1682	297	12	,	,	PUNCT
ap-1682	297	13	2004	2004	NUM
ap-1682	297	14	,	,	PUNCT
ap-1682	297	15	p.	p.	NOUN
ap-1682	297	16	170–173	170–173	NUM
ap-1682	297	17	.	.	PUNCT
ap-1682	298	1	[	[	X
ap-1682	298	2	16	16	NUM
ap-1682	298	3	]	]	X
ap-1682	298	4	lemonge	lemonge	NOUN
ap-1682	298	5	,	,	PUNCT
ap-1682	298	6	a.	a.	PROPN
ap-1682	298	7	c.	c.	PROPN
ap-1682	298	8	c.	c.	PROPN
ap-1682	298	9	,	,	PUNCT
ap-1682	298	10	barbosa	barbosa	PROPN
ap-1682	298	11	,	,	PUNCT
ap-1682	298	12	h.	h.	PROPN
ap-1682	298	13	j.	j.	PROPN
ap-1682	298	14	c.	c.	PROPN
ap-1682	298	15	:	:	PUNCT
ap-1682	298	16	“	"	PUNCT
ap-1682	298	17	an	an	DET
ap-1682	298	18	adaptive	adaptive	ADJ
ap-1682	298	19	penalty	penalty	NOUN
ap-1682	298	20	scheme	scheme	NOUN
ap-1682	298	21	for	for	ADP
ap-1682	298	22	genetic	genetic	ADJ
ap-1682	298	23	algorithms	algorithm	NOUN
ap-1682	298	24	in	in	ADP
ap-1682	298	25	structural	structural	ADJ
ap-1682	298	26	optimization	optimization	NOUN
ap-1682	298	27	.	.	PUNCT
ap-1682	298	28	”	"	PUNCT
ap-1682	299	1	int	int	PROPN
ap-1682	299	2	j	j	PROPN
ap-1682	299	3	numer	numer	PROPN
ap-1682	299	4	meth	meth	PROPN
ap-1682	299	5	eng	eng	PROPN
ap-1682	299	6	,	,	PUNCT
ap-1682	299	7	59	59	NUM
ap-1682	299	8	(	(	PUNCT
ap-1682	299	9	5	5	NUM
ap-1682	299	10	)	)	PUNCT
ap-1682	299	11	,	,	PUNCT
ap-1682	299	12	2004	2004	NUM
ap-1682	299	13	,	,	PUNCT
ap-1682	299	14	p.	p.	NOUN
ap-1682	299	15	703–736	703–736	NUM
ap-1682	299	16	.	.	PUNCT
ap-1682	300	1	[	[	X
ap-1682	300	2	17	17	NUM
ap-1682	300	3	]	]	SYM
ap-1682	300	4	li	li	PROPN
ap-1682	300	5	,	,	PUNCT
ap-1682	300	6	l.	l.	PROPN
ap-1682	300	7	j.	j.	PROPN
ap-1682	300	8	,	,	PUNCT
ap-1682	300	9	huang	huang	PROPN
ap-1682	300	10	,	,	PUNCT
ap-1682	300	11	z.	z.	PROPN
ap-1682	300	12	b.	b.	PROPN
ap-1682	300	13	,	,	PUNCT
ap-1682	300	14	liu	liu	PROPN
ap-1682	300	15	,	,	PUNCT
ap-1682	300	16	f.	f.	PROPN
ap-1682	300	17	:	:	PUNCT
ap-1682	300	18	“	"	PUNCT
ap-1682	300	19	a	a	DET
ap-1682	300	20	heuristic	heuristic	ADJ
ap-1682	300	21	particle	particle	NOUN
ap-1682	300	22	swarm	swarm	NOUN
ap-1682	300	23	optimization	optimization	NOUN
ap-1682	300	24	method	method	NOUN
ap-1682	300	25	for	for	ADP
ap-1682	300	26	truss	truss	ADJ
ap-1682	300	27	structures	structure	NOUN
ap-1682	300	28	with	with	ADP
ap-1682	300	29	discrete	discrete	ADJ
ap-1682	300	30	variables	variable	NOUN
ap-1682	300	31	.	.	PUNCT
ap-1682	300	32	”	"	PUNCT
ap-1682	301	1	comput	comput	NOUN
ap-1682	301	2	struct	struct	NOUN
ap-1682	301	3	,	,	PUNCT
ap-1682	301	4	87	87	NUM
ap-1682	301	5	(	(	PUNCT
ap-1682	301	6	7	7	NUM
ap-1682	301	7	-	-	SYM
ap-1682	301	8	8)	8)	NUM
ap-1682	301	9	,	,	PUNCT
ap-1682	301	10	2009	2009	NUM
ap-1682	301	11	,	,	PUNCT
ap-1682	301	12	p.	p.	NOUN
ap-1682	301	13	435–443	435–443	NUM
ap-1682	301	14	.	.	PUNCT
ap-1682	302	1	[	[	X
ap-1682	302	2	18	18	NUM
ap-1682	302	3	]	]	X
ap-1682	302	4	coello	coello	PROPN
ap-1682	302	5	,	,	PUNCT
ap-1682	302	6	c.	c.	PROPN
ap-1682	302	7	a.	a.	PROPN
ap-1682	302	8	c.	c.	PROPN
ap-1682	302	9	:	:	PUNCT
ap-1682	302	10	discrete	discrete	ADJ
ap-1682	302	11	optimization	optimization	NOUN
ap-1682	302	12	of	of	ADP
ap-1682	302	13	trusses	truss	NOUN
ap-1682	302	14	using	use	VERB
ap-1682	302	15	genetic	genetic	ADJ
ap-1682	302	16	algorithms	algorithm	NOUN
ap-1682	302	17	.	.	PUNCT
ap-1682	303	1	in	in	ADP
ap-1682	303	2	:	:	PUNCT
ap-1682	303	3	“	"	PUNCT
ap-1682	303	4	expersys-94	expersys-94	ADJ
ap-1682	303	5	:	:	PUNCT
ap-1682	303	6	expert	expert	NOUN
ap-1682	303	7	systems	system	NOUN
ap-1682	303	8	applications	application	NOUN
ap-1682	303	9	and	and	CCONJ
ap-1682	303	10	artificial	artificial	ADJ
ap-1682	303	11	intelligence	intelligence	NOUN
ap-1682	303	12	”	"	PUNCT
ap-1682	303	13	.	.	PUNCT
ap-1682	304	1	i.i.t.t	i.i.t.t	PROPN
ap-1682	304	2	.	.	PROPN
ap-1682	304	3	international	international	PROPN
ap-1682	304	4	,	,	PUNCT
ap-1682	304	5	1994	1994	NUM
ap-1682	304	6	,	,	PUNCT
ap-1682	304	7	p.	p.	NOUN
ap-1682	304	8	331–336	331–336	NUM
ap-1682	304	9	.	.	PUNCT
ap-1682	305	1	81	81	NUM