Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search: Interfaces in Computer Science and Operations Research
David L. Woodruff
Springer Science & Business Media, Dec 31, 1997 - Business & Economics - 312 pages
Computer Science and Operations Research continue to have a synergistic relationship and this book - as a part of the Operations Research and Computer Science Interface Series - sits squarely in the center of the confluence of these two technical research communities. The research presented in the volume is evidence of the expanding frontiers of these two intersecting disciplines and provides researchers and practitioners with new work in the areas of logic programming, stochastic optimization, heuristic search and post-solution analysis for integer programs.
The chapter topics span the spectrum of application level. Some of the chapters are highly applied and others represent work in which the application potential is only beginning. In addition, each chapter contains expository material and reviews of the literature designed to enhance the participation of the reader in this expanding interface.
What people are saying - Write a review
We haven't found any reviews in the usual places.
CONSTRAINT SATISFACTION METHODS FOR GENERATING VALID CUTS
EXTENDING A GENERALPURPOSE ALGEBRAIC MODELING LANGUAGE TO COMBINATORIAL OPTIMIZATION A LOGIC PROGRAMMI...
DISJUNCTIVE PROGRAMMING AND COOPERATING SOLVERS
AN ANNOTATED BIBLIOGRAPHY FOR POSTSOLUTION ANALYSIS IN MIXED INTEGER PROGRAMMING AND COMBINATORIAL OPTI...
ON A STOCHASTIC KNAPSACK PROBLEM AND GENERALIZATIONS
SAMPLEPATH SOLUTIONS FOR SIMULATION OPTIMIZATION PROBLEMS AND STOCHASTIC VARIATIONAL INEQUALITIES
PLAY SELECTION IN AMERICAN FOOTBALL A CASE STUDY IN NEURODYNAMIC PROGRAMMING
TABU SEARCH CANDIDATE LIST STRATEGIES IN SCHEDULING
USING SURROGATE CONSTRAINTS IN GENETIC ALGORITHMS FOR SOLVING MULTIDIMENSIONAL KNAPSACK PROBLEMS
INTRODUCTION TO GENETIC HEURISTICS AND VEHICLE ROUTING PROBLEMS WITH COMPLEX CONSTRAINTS
A GENETIC ALGORITHM FOR THE CLUSTERED TRAVELING SALESMAN PROBLEM WITH A PRESPECIFIED ORDER ON THE CLUSTERS
A NEW ALGORITHM FOR THE SITEDEPENDENT VEHICLE ROUTING PROBLEM
Other editions - View all
Advances in Computational and Stochastic Optimization, Logic Programming ...
David L. Woodruff
No preview available - 2010
activity adaptive consistency algebraic modeling languages AMPL AMPL's applied approach approximation assignment backtracking binary branch and bound chromosome clauses cluster combinatorial optimization computational consider constraint satisfaction convergence cooperating solvers cost Cplex crossover customers defined dependency graph discrete disjunctive dynamic programming edge evaluation example extensions fc-consistency feasible region genetic algorithm GenSect heuristic implementation induced width infeasible integer linear programming integer programming iteration JOBS knapsack problem level candidate list linear programming logic programming MACHINES makespan Mathematical Programming MILP minimize move node number of vehicles objective function obtained Operations Research optimal solution optimization problems param parameter postoptimal procedure random reward-to-go right-hand side sample-path scheduling Section selection sensitivity analysis sequence simulation solve spanning tree stability stability radius stochastic subj subset surrogate constraints Tabu Search Theorem total distance traveled valid cuts variables variational inequality vector vehicle routing problem vehicle type