Advances in Optimization and Approximation Book

	Preface
	Scheduling Multiprocessor Flow Shops	1
	The k-Walk Polyhedron	9
	Two Geometric Optimization Problems	30
	A Scaled Gradient Projection Algorithm for Linear Complementarity Problems	58
	A Simple Proof for a Result of Ollerenshaw on Steiner Trees	68
	Optimization Algorithms for the Satisfiability (SAT) Problem	72
	Ergodic Convergence in Proximal Point Algorithms with Bregman Functions	155
	Adding and Deleting Constraints in the Logarithmic Barrier Method for LP	166
	A Projection Method for Solving Infinite Systems of Linear Inequalities	186
	Optimization Problems in Molecular Biology	195
	A Dual Affine Scaling Based Algorithm for Solving Linear Semi-infinite Programming Problems	217
	A Genuine Quadratically Convergent Polynomial Interior Point Algorithm for Linear Programming	235
	A Modified Barrier Function Method for Linear Programming	247
	A New Facet Class and a Polyhedral Method for the Three-Index Assignment Problem	256
	A Finite Simplex-Active-Set Method for Monotropic Piecewise Quadratic Programming	275
	A New Approach in the Optimization of Exponential Queues	293
	The Euclidean Facilities Location Problem	313
	Optimal Design of Large-Scale Opencut Coal Mine System	332
	On the Strictly Complementary Slackness Relation in Linear Programming	347
	Analytical Properties of the Central Trajectory in Interior Point Methods	362
	The Approximation of Fixed Points of Robust Mappings	376