%{search_type} search results

• A Critical Element-Guided Perturbation Strategy for Iterated Local Search.- A Genetic Algorithm for Net Present Value Maximization for Resource Constrained Projects.- A Hybrid Algorithm for Computing Tours in a Spare Parts Warehouse.- A New Binary Description of the Blocks Relocation Problem and Benefits in a Look Ahead Heuristic.- A Plasmid Based Transgenetic Algorithm for the Biobjective Minimum Spanning Tree Problem.- A Tabu Search Algorithm with Direct Representation for Strip Packing.- An ACO Approach to Planning.- An Artificial Immune System for the Multi-Mode Resource-Constrained Project Scheduling Problem.- Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows.- Binary Exponential Back Off for Tabu Tenure in Hyperheuristics.- Diversity Control and Multi-Parent Recombination for Evolutionary Graph Coloring Algorithms.- Divide-And-Evolve Facing State-of-the-Art Temporal Planners during the 6 th International Planning Competition.- Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm.- Finding Balanced Incomplete Block Designs with Metaheuristics.- Guided Ejection Search for the Job Shop Scheduling Problem.- Improving Performance in Combinatorial Optimisation Using Averaging and Clustering.- Iterated Local Search for Minimum Power Symmetric Connectivity in Wireless Networks.- Metropolis and Symmetric Functions: A Swan Song.- Robustness Analysis in Evolutionary Multi-Objective Optimization Applied to VAR Planning in Electrical Distribution Networks.- Staff Scheduling with Particle Swarm Optimisation and Evolution Strategies.- University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study.
• (source: Nielsen Book Data)

Metaheuristics have been shown to be e?ective for di?cult combinatorial op- mization problems appearing in a wide variety of industrial, economic, and sci- ti?c domains. Prominent examples of metaheuristics are evolutionary algorithms, tabu search, simulated annealing, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, ant colony optimization, and estimation of distribution algorithms. Problems solved successfully include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman problem, packing and cutting, satis?ability, and general mixed integer programming. EvoCOP began in 2001 and has been held annually since then. It is the ?rst event speci?cally dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems. Originally held as a workshop, EvoCOP became a conference in 2004. The events gave researchers an excellent opportunity to present their latest research and to discuss current - velopments and applications. Following the general trend of hybrid metaheur- tics and diminishing boundaries between the di?erent classes of metaheuristics, EvoCOP has broadened its scope in recent years and invited submissions on any kind of metaheuristic for combinatorial optimization.
(source: Nielsen Book Data)

• Algorithms for Network Design.- Polynomial Approximation Schemes for the Max-Min Allocation Problem under a Grade of Service Provision.- A Linear Time Algorithm for Computing the Most Reliable Source on a Tree with Faulty Vertices.- A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines.- A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs.- Bioinformatics.- DNA Library Screening, Pooling Design and Unitary Spaces.- Improved Algorithms for the Gene Team Problem.- Linear Coherent Bi-cluster Discovery via Line Detection and Sample Majority Voting.- Combinatorics and Its Applications.- Generalized Russian Cards Problem.- Computing the Transitive Closure of a Union of Affine Integer Tuple Relations.- Matching Techniques Ride to Rescue OLED Displays.- Computational Geometry.- On Open Rectangle-of-Influence Drawings of Planar Graphs.- An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems.- Variable-Size Rectangle Covering.- On-Line Multiple-Strip Packing.- Game Theory.- A Cost-Sharing Method for the Soft-Capacitated Economic Lot-Sizing Game.- Improved Bounds for Facility Location Games with Fair Cost Allocation.- Graph Algorithms.- Two-Level Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem.- On Construction of Almost-Ramanujan Graphs.- A 2log2(n)-Approximation Algorithm for Directed Tour Cover.- Approximation Algorithms for Max 3-Section Using Complex Semidefinite Programming Relaxation.- Graph Theory.- Hamiltonian Decomposition of Some Interconnection Networks.- Infinite Family from Each Vertex k-Critical Graph without Any Critical Edge.- A Note on Edge Choosability and Degeneracy of Planar Graphs.- A Sufficient and Necessary Condition for the Forcing Number of a Bipartite Graph Being Equal to the Minimum Number of Trailing Vertices.- On Integrity of Harary Graphs.- A Note on n-Critical Bipartite Graphs and Its Application.- Network Models and Problems.- Real-Time Algorithm Scheme for n-Vehicle Exploration Problem.- Deterministically Estimating Data Stream Frequencies.- Positive Influence Dominating Set in Online Social Networks.- On-line Algorithms.- Optimal Algorithms for the Online Time Series Search Problem.- A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information.- Optimal Semi-online Algorithm for Scheduling on a Batch Processing Machine.- A Note on Online Scheduling for Jobs with Arbitrary Release Times.- Size-Problems.- Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem.- On Disjoint Shortest Paths Routing on the Hypercube.- A New Approach for Rearrangeable Multicast Switching Networks.- Scheduling.- Bicriteria Scheduling on Single-Machine with Inventory Operations.- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine.- Scheduling with Rejection to Minimize the Makespan.- Scheduling Problems in Cross Docking.- Makespan Minimization with Machine Availability Constraints.- A Mathematical Programming Approach for Online Hierarchical Scheduling.- Recoverable Robust Timetables on Trees.- Roulette Wheel Graph Colouring for Solving Examination Timetabling Problems.- Integrated Production and Delivery Scheduling with Disjoint Windows.- Wireless and Optical Networks.- Fault-Tolerant Routing: k-Inconnected Many-to-One Routing in Wireless Networks.- A Branch-and-Cut Algorithm for the Minimum Energy Symmetric Connectivity Problem in Wireless Networks.- Minimum Energy Broadcast Routing in Ad Hoc and Sensor Networks with Directional Antennas.- Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings.- An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings.
• (source: Nielsen Book Data)

TheThirdAnnualInternationalConferenceonCombinatorialOptimizati onand Applications, COCOA2009, tookplace in Huangshan, China, June 10-12,2009. Past COCOA conferences were held in Xi'an, China (2007) and Newfoundland, Canada (2008). COCOA2009providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference is particularly focused on recent works on experimental and applied research of general algorithmic interest. The Program Committee received 103 submissions from 17 countries and regions: Brazil, Canada, China, Denmark, France, Germany, Hong Kong, India, Italy, Japan, Korea, Malaysia, Poland, Switzerland, Taiwan, UK, and USA. Among the 103 submissions, 50 papers were selected for presentation at the conference and are included in this volume. Some of these will be selected for publicationinaspecialissueofJournalof Combinatorial Optimization, aspecial issue of Theoretical Computer Science, and a special issue of Discrete Mat- matics, Algorithms and Applications under the standard refereeing procedure. In addition to the selected papers, the conference also included one invited p- sentation by Panos M. Pardalos (University of Florida, USA). We thank the authors for submitting their papers to the conference. We are grateful to the members of the Program Committee and the external referees for their work within demanding time constraints. We thank the Organizing Committee for their contribution to make the conference a success. We also thank Donghyun Kim for helping us create and update the conference website and maintain the Springer Online Conference Service system.
(source: Nielsen Book Data)

• W. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph.- J. Diaz et al., On List k-Coloring Convex Bipartite Graphs.- E. Kubicka et al., Total chromatic sum for trees.- S. Ghosal and S. C. Ghosh, An incremental search heuristic for coloring vertices of a graph.- S. Bandopadhyay et al., Improved Bounds on the Span of L(1,2)-edge Labeling of Some Infinite Regular Grids.- E. Althaus and S. Ziegler, Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm.- H. Kerivin and A. Wagler, On superperfection of edge intersection graphs of paths.- L. Liberti et al., A cycle-based formulation for the Distance Geometry Problem.- P. Samer and D. Haugland, The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope.- Lucas L. S. Portugal et al., Relating hypergraph parameters of generalized power graphs.- A. Nixon, Assur decompositions of direction-length frameworks.- M. Hiller et al., On the Burning Number of p-Caterpillars.- J. Boeckmann and C. Thielen, An Approximation Algorithm for Network Flow Interdiction with Unit Costs and Two Capacities.- T. Bacci and S. Nicoloso, On the benchmark instances for the Bin Packing Problem with Conflicts.- Barbara M. Anthony and Alison M. Marr, Directed Zagreb Indices.- F. Couto et al., Edge Tree Spanners.- S. Khalife, Sequence graphs: characterization and counting of admissible elements.- L. Burahem Martins et al., On solving the time window assignment vehicle routing problem via iterated local search.- M. Barbato et al., Synchronized Pickup and Delivery Problems with Connecting FIFO Stack.- A. Teymourifar et al., A Comparison Between Simultaneous and Hierarchical Approaches to Solve a Multi-Objective Location-Routing Problem.- M. Bodirsky et al., Piecewise Linear Valued Constraint Satisfaction Problems with Fixed Number of Variables.- M. Cacciola et al., A Lagrangian approach to Chance Constrained Routing with Local Broadcast.- P. Detti et al., A metaheuristic approach for biological sample transportation in healthcare.- Diego M. Pinto and G. Stecca, Optimal Planning of Waste Sorting Operations through Mixed Integer Linear Programming.- G. Micheli et al., Selecting and Initializing Representative Days for Generation and Transmission Expansion Planning with High Shares of Renewables.- T. Bacci et al., Start-up/Shut-down MINLP formulations for the Unit Commitment with Ramp Constraints.- J. Lee et al., Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions.- M. Aprile et al., Recognizing Cartesian products of matrices and polytopes.- A. Frank, Special subclass of Generalized Semi-Markov Decision Processes with discrete time.- R. Seccia et al., Coupling Machine Learning and Integer Programming for Optimal TV Promo Scheduling.- F. Mendoza-Granada and M. Villagra, A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering.
• (source: Nielsen Book Data)

This book highlights new and original contributions on Graph Theory and Combinatorial Optimization both from the theoretical point of view and from applications in all fields. The book chapters describe models and methods based on graphs, structural properties, discrete optimization, network optimization, mixed-integer programming, heuristics, meta-heuristics, math-heuristics, and exact methods as well as applications. The book collects selected contributions from the CTW2020 international conference (18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization), held online on September 14-16, 2020. The conference was organized by IASI-CNR with the contribution of University of Roma Tre, University Roma Tor Vergata, and CNRS-LIX and with the support of AIRO. It is addressed to researchers, PhD students, and practitioners in the fields of Graph Theory, Discrete Mathematics, Combinatorial Optimization, and Operations Research.
(source: Nielsen Book Data)

• Statistical Measurements of Metaheuristics for Solving Engineering Problems.- Heuristic Approaches for the Stochastic Multi-Depot Vehicle Routing Problem with Pickup and Delivery.- Evaluation of MO-ACO Algorithms Using a New Fast Inter-Criteria Analysis Method.- Semantic Graph Queries on Linked Data in Knowledge Graphs.- Online Single-Machine Scheduling via Reinforcement Learning.- Ant Colony Optimization Algorithm for Fuzzy Transport Modelling: InterCriteria Analysis.- Approximation and Exact Algorithms for Multiprocessor Scheduling Problem with Release and Delivery Times.- A Hybrid Method for Scheduling Multiprocessor Tasks on Two Dedicated Processors.- Mathematical Model and its Optimization to Predict the Parameters of Compressive Strength Test.- Optimal Tree of a Complete Weighted Graph.- Simulation of Diffusion Processes in Bimetallic Nanofilms.- On the Problem of Bimetallic Nanostructures Optimization: An Extended Two-Stage Monte Carlo Approach.- An Analysis on the Degrees of Freedom of Binary Representations for Solutions to Discretizable Distance Geometry Problems.- Dynamic Programming for the Synchronization of Energy Production and Consumption Processes.- Reducing the First-type Error Rate of the Log-rank Test: Asymptotic Time Complexity Analysis of an Optimized Test's Alternative.- Zero Point Approach to Three-Dimensional Intuitionistic Fuzzy Transportation Problem.- On Index-Matrix Interpretation of Interval-Valued Intuitionistic Fuzzy Hamiltonian Cycle.- On the Conceptual Optimization of Generalized Net Models.- Sensitivity Study of a Large-Scale Air Pollution Model by Using Optimized Latin Hyprecube Sampling.- Optimized Quasi-Monte Carlo Methods Based on Van der Corput Sequence for Sensitivity Analysis in Air Pollution Modelling.- Advanced Stochastic Approaches Based on Lattice Rules for Multiple Integrals in Option Pricing.- Advanced Stochastic Approaches for Multidimensional Integrals in Neural Networks.- Improved Stochastic Approaches for Evaluation of the Wigner Kernel.- A Numerical Study on Optimal Monte Carlo Algorithm for Multidimensional Integrals.- Expansions on Quadrature Formulas and Numerical Solutions of Ordinary Differential Equations.- Advanced Stochastic Approaches Based on Lattice Rules for Multiple Integrals in Option Pricing.
• (source: Nielsen Book Data)

This book presents recent advances in computational optimization. Our everyday life is unthinkable without optimization. We try to minimize our effort and to maximize the achieved profit. Many real-world and industrial problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. The book is a comprehensive collection of extended contributions from the Workshops on Computational Optimization 2020. The book includes important real problems like modeling of physical processes, workforce planning, parameter settings for controlling different processes, transportation problems, wireless sensor networks, machine scheduling, air pollution modeling, solving multiple integrals and systems of differential equations which describe real processes, solving engineering problems. It shows how to develop algorithms for them based on new intelligent methods like evolutionary computations, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics and other domains can be formulated as optimization problems.
(source: Nielsen Book Data)

• Validation and optimization of dam break flood risk mapping based on field test cases in Armenia.- Fire Simulator capable to analyze fire spread in real time with limited field weather data. Case study - Kresna Fire (2017).- Utilizing Minimum Set-Cover Structures with Several Constraints for Knowledge Discovery on Large Literature Databases.- Evaluation of optimal charging station location for electric vehicles: an Italian case-study.- InterCriteria Analysis of the Evaporation Parameter Influence on Ant Colony Optimization Algorithm: A Workforce Planning Problem.- Caterpillar Alignment Distance for Rooted Labeled Caterpillars: Distance Based on Alignments Required to Be Caterpillars.- ICrA over Ordered Pairs Applied to ABC Optimization Results.- A Game Theoretical Approach for VLSI Physical Design Placement.- Application of information systems and technologies in transport.- Online algorithms for 1-space bounded cube packing and 2-space bounded hypercube packing.
• (source: Nielsen Book Data)

This book is a comprehensive collection of extended contributions from the Workshops on Computational Optimization 2019.Our everyday life is unthinkable without optimization. We try to minimize our effort and to maximize the achieved profit. Many real-world and industrial problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. This book presents recent advances in computational optimization. The book includes important real problems like modeling of physical processes, wildfire and flood risk modeling, workforce planning, parameter settings for controlling different processes, optimal electrical vehicle modeling, bioreactor modeling and design of VLSI. It shows how to develop algorithms for them based on new intelligent methods like evolutionary computations, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics and other domains can be formulated as optimization problems.
(source: Nielsen Book Data)

• Improving the Approximation Ratio for Capacitated Vehicle Routing.- Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual.- Approximating the discrete time-cost tradeoff problem with bounded depth.- Sum-of-squares hierarchies for binary polynomial optimization.- Complexity, Exactness, and Rationality in Polynomial Optimization.- On the Geometry of Symmetry Breaking Inequalities.- Affinely representable lattices, stable matchings, and choice functions.- A Finite Time Combinatorial Algorithm for Instantaneous Dynamic Equilibrium Flows.- A combinatorial algorithm for computing the degree of the determinant of a generic partitioned polynomial matrix with $2 \times 2$ submatrices.- On the implementation and strengthening of intersection cuts for QCQPs.- Lifting Convex Inequalities for Bipartite Bilinear Programs.- A Computational Status Update for Exact Rational Mixed Integer Programming.- New Exact Techniques Applied to a Class of Network Flow Formulations.- Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets.- Semi-Streaming Algorithms for Submodular Matroid Intersection.- Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems.- On the recognition of {a, b, c}-modular matrices.- On the Power of Static Assignment Policies for Robust Facility Location Problems.- Robust k-Center with Two Types of Radii.- Speed-Robust Scheduling - Rocks, Bricks, and Sand.- The Double Exponential Runtime is Tight for 2-Stage Stochastic ILPs.- Fast Quantum Subroutines for the Simplex Method.- Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators.- A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem.- Fixed Parameter Approximation Scheme for Min-max k-cut.- Computational Aspects of Relaxation Complexity.- Complexity of branch-and-bound and cutting planes in mixed-integer optimization - II.- Face Dimensions of General-Purpose Cutting Planes for Mixed-Integer Linear Programs.- Proximity bounds for random integer programs.- On the Integrality Gap of Binary Integer Programs with Gaussian Data.- Linear Regression with Mismatched Data: a Provably Optimal Local Search Algorithm.- A New Integer Programming Formulation of the Graphical Traveling Salesman Problem.- Implications, conflicts, and reductions for Steiner trees.
• (source: Nielsen Book Data)

This book constitutes the proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization, IPCO 2021, which took place during May 19-21, 2021. The conference was organized by Georgia Institute of Technology and planned to take place it Atlanta, GA, USA, but changed to an online format due to the COVID-19 pandemic. The 33 papers included in this book were carefully reviewed and selected from 90 submissions. IPCO is under the auspices of the MathematicalOptimization Society, and it is an important forum for presenting the latest results of theory and practice of the various aspects of discrete optimization.
(source: Nielsen Book Data)

• Idealness of k-wise intersecting families.- Flexible Graph Connectivity: Approximating Network Design Problems Between
• 1- and 2-connectivity.- Faster Algorithms for Parametric Global Minimum Cut Problems.- Optimizing Sparsity over Lattices and Semigroups.- A Technique for Obtaining True Approximations for k-Center with Covering Constraints.- Tight Approximation Bounds for Maximum Multi-Coverage.- Implementing automatic Benders decomposition in a modern MIP solver.- Improved Approximation Algorithms for Inventory Problems.- Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles.- On a generalization of the Chv atal-Gomory closure.- Algorithms for ows over time with scheduling costs.- Integer Plane Multi ow Maximisation: Flow-Cut Gap and One-Quarter-Approximation.- Stochastic Makespan Minimization in Structured Set Systems.- Continuous facility location on graphs.- Recognizing even-cycle and even-cut matroids.- A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 ntimes 2$ submatrices.- Fair Colorful k-Center Clustering.- Popular Branchings and Their Dual Certi cates.- Sparse graphs and an augmentation problem.- About the Complexity of Two-Stage Stochastic Ips.- Packing under Convex Quadratic Constraints.- Weighted Triangle-free 2-matching Problem with Edge-disjoint Forbidden Triangles.- Single source unsplittable ows with arc-wise lower and upper bounds.- Maximal quadratic-free sets.- On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming.- Andrea Lodi and Felipe Serrano.- The integrality number of an integer program.- Persistency of Linear Programming Relaxations for the Stable Set Problem.- Constructing lattice-free gradient polyhedra in dimension two.- Sequence independent lifting for the set of submodular maximization problem.- A Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering.- Graph Coloring Lower Bounds from Decision Diagrams.- On convex hulls of epigraphs of QCQPs.- On the convexi cation of constrained quadratic optimization problems with indicator variables.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefully reviewed and selected from 126 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas.
(source: Nielsen Book Data)

• Cover
• Contents
• Part I: The Early Years
• 1 Solution of a Large-Scale Traveling-Salesman Problem
• 2 The Hungarian Method for the Assignment Problem
• 3 Integral Boundary Points of Convex Polyhedra
• 4 Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem
• 5 An Automatic Method for Solving Discrete Programming Problems
• 6 Integer Programming: Methods, Uses, Computation
• 7 Matroid Partition
• 8 Reducibility Among Combinatorial Problems
• 9 Lagrangian Relaxation for Integer Programming
• 10 Disjunctive Programming
• Part II: From the Beginnings to the State-of-the-Art
• 11 Polyhedral Approaches to Mixed Integer Linear Programming
• 11.1 Introduction
• 11.2 Polyhedra and the fundamental theorem of integer programming
• 11.3 Union of polyhedra
• 11.4 Split disjunctions
• 11.5 Gomory8217; s mixed-integer inequalities
• 11.6 Polyhedrality of closures
• 11.7 Lift-and-project
• 11.8 Rank
• References
• 12 Fifty-Plus Years of Combinatorial Integer Programming
• 12.1 Combinatorial integer programming
• 12.2 The TSP in the 1950s
• 12.3 Proving theorems with linear-programming duality
• 12.4 Cutting-plane computation
• 12.5 Jack Edmonds, polynomial-time algorithms, and polyhedral combinatorics
• 12.6 Progress in the solution of the TSP
• 12.7 Widening the field of application in the 1980s
• 12.8 Optimization 8801; Separation
• 12.9 State of the art
• References
• 13 Reformulation and Decomposition of Integer Programs
• 13.1 Introduction
• 13.2 Polyhedra, reformulation and decomposition
• 13.3 Price or constraint decomposition
• 13.4 Resource or variable decomposition
• 13.5 Extended formulations: problem specific approaches
• 13.6 Hybrid algorithms and stronger dual bounds
• 13.7 Notes
• References
• Part III: Current Topics
• 14 Integer Programming and Algorithmic Geometry of Numbers
• 14.1 Lattices, integer programming and the geometry of numbers
• 14.2 Informal introduction to basis reduction
• 14.3 The Hermite normal form
• 14.4 Minkowski8217; s theorem
• 14.5 The LLL algorithm
• 14.6 Kannan8217; s shortest vector algorithm
• 14.7 A randomized simply exponential algorithm for shortest vector
• 14.8 Integer programming in fixed dimension
• 14.9 The integer linear optimization problem
• 14.10 Diophantine approximation and strongly polynomial algorithms
• 14.11 Parametric integer programming
• References
• 15 Nonlinear Integer Programming
• 15.1 Overview
• 15.2 Convex integer maximization
• 15.3 Convex integer minimization
• 15.4 Polynomial optimization
• 15.5 Global optimization
• 15.6 Conclusions
• References
• 16 Mixed Integer Programming Computation
• 16.1 Introduction
• 16.2 MIP evolution
• 16.3 MIP challenges
• 16.4 Conclusions
• References
• 17 Symmetry in Integer Linear Programming
• 17.1 Introduction
• 17.2 Preliminaries
• 17.3 Detecting symmetries
• 17.4 Perturbation
• 17.5 Fixing variables
• 17.6 Symmetric polyhedra and related topics
• 17.7 Partitioning problems
• 17.8 Symmetry breaking inequalities
• 17.9 Pruning the enumeration tree
• 17.10 Group representation and operations
• 17.11 Enumerating all non-isomorphic solutions
• 17.12 Furthering the reach of isomorphism pruning
• 17.13 Choice of f.

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a paper that described a cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In 2008, to commemorate the anniversary of this seminal paper, a special workshop celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. 50 Years of Integer Programming offers an account of featured talks and a panel discussion at the Aussois workshop with six pioneers on a DVD Video. It also contains reprints of key historical articles and written versions of survey lectures on six of the hottest topics in the field by distinguished members of the IP community. Useful for anyone in mathematics, computer science and operations research, this book exposes mathematical optimization, specifically integer programming and combinatorial optimization, to a broad audience.
(source: Nielsen Book Data)

• Invited Talks.- Machine Learning Framework for Classification in Medicine and Biology.- G12 - Towards the Separation of Problem Modelling and Problem Solving.- Regular Papers.- Six Ways of Integrating Symmetries within Non-overlapping Constraints.- Throughput Constraint for Synchronous Data Flow Graphs.- A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem.- Backdoors to Combinatorial Optimization: Feasibility and Optimality.- Solution Enumeration for Projected Boolean Search Problems.- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach.- Optimal Interdiction of Unreactive Markovian Evaders.- Using Model Counting to Find Optimal Distinguishing Tests.- Reformulating Global Grammar Constraints.- IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems.- Open Constraints in a Boundable World.- Sequencing and Counting with the multicost-regular Constraint.- Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services.- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming.- The Polytope of Context-Free Grammar Constraints.- Determining the Number of Games Needed to Guarantee an NHL Playoff Spot.- Scalable Load Balancing in Nurse to Patient Assignment Problems.- Learning How to Propagate Using Random Probing.- DFS* and the Traveling Tournament Problem.- Max Energy Filtering Algorithm for Discrete Cumulative Resources.- Extended Abstracts.- Hybrid Branching.- Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations.- Constraint Models for Sequential Planning.- A Fast Algorithm to Solve the Frequency Assignment Problem.- A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem.- Modelling Search Strategies in Rules2CP.- CP-INSIDE: Embedding Constraint-Based Decision Engines in Business Applications.- An Integrated Genetic Algorithm and Integer Programming Approach to the Network Design Problem with Relays.- A Benders'Approach to a Transportation Network Design Problem.- Progress on the Progressive Party Problem.
• (source: Nielsen Book Data)

The6thInternationalConferenceontheIntegrationofAIandORTechniqu esin Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2009) was held in Pittsburgh, USA, May 29-31, 2009. More information about the CPAIOR conference series can be found atwww.cpaior.org. This volume contains the papers and extended abstracts that were presented during the c- ference. In total there were 65 high-quality submissions, including 41 full paper and 24 extended abstract submissions. The full papers re?ect original unpublished work, whereas the extended abstracts can be either original unpublished work or a summary of work published elsewhere. Each full paper was reviewed by at least three Program Committee members, and most extended abstracts by two. After generaldiscussion, the ProgramCommitteeaccepted 20full papersand 10 extendedabstractsforpresentationduringtheconferenceandpublicatio ninthis volume. The submissions, reviews, discussion, and the proceedings preparation were all handled by the EasyChair system. We thank the Program Committee, as well as the external reviewers, for their hard work. Inadditiontothefullpaperandextendedabstractpresentation, theprogram contained two invited talks, by Eva K. Lee (Georgia Institute of Technology) and Mark Wallace (Monash University). A summary of each invited talk is also included in this volume. Atwo-daytutorialonconstraintprogrammingwasheldbeforetheconferenc e, during May 27-28, 2009. There were four parts to the tutorial: "Introduction to CP Concepts" presented by Peter van Beek, "Modeling in CP" presented by Helmut Simonis, "Combining CP and Operations Research" presented by John Hooker, and "CP Languages, Systems, and Examples" presented by Laurent Michel, Pascal Van Hentenryck, and Paul Shaw. We thank all tutorial speakers for their e?orts. We also thank the tutorial chair Gilles Pesant for his help in organizing this event.
(source: Nielsen Book Data)

• Fast Output-Sensitive Approach for Minimum Convex Hulls Formation
• Local Search Algorithms for Portfolio Selection: Search Space and Correlation Analysis
• Optimization of Fuel Consumption in Firefighting Water Capsule Flights of a Helicopter
• Practical Application of OFN arithmetics in a Crisis Control Center Monitoring
• Forecasting Indoor Temperature Using Fuzzy Cognitive Maps with Structure Optimization Genetic Algorithm
• Correlation Clustering by Contraction, a More Effective Method
• Synthesis of Power Aware Adaptive Embedded Software Using Developmental Genetic Programming
• Flow Design and Evaluation in Photonic Data Transport Network
• Introducing the Environment in Ant Colony Optimization
• Fast Preconditioned Solver for Truncated Saddle Point Problem in Nonsmooth Cahn-Hilliard Model
• The Constraints Aggregation Technique for Control of Ethanol Production
• InterCriteria Analysis by Pairs and Triples of Genetic Algorithms Application for Models Identification
• Genetic Algorithms for Constrained Tree Problems
• InterCriteria Analysis of Genetic Algorithms Performance
• Exploring Sparse Covariance Estimation Techniques in Evolution Strategies
• Parallel Metaheuristics for Robust Graph Coloring Problem.

This volume is a comprehensive collection of extended contributions from the Workshop on Computational Optimization 2015. It presents recent advances in computational optimization. The volume includes important real life problems like parameter settings for controlling processes in bioreactor, control of ethanol production, minimal convex hill with application in routing algorithms, graph coloring, flow design in photonic data transport system, predicting indoor temperature, crisis control center monitoring, fuel consumption of helicopters, portfolio selection, GPS surveying and so on. It shows how to develop algorithms for them based on new metaheuristic methods like evolutionary computation, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics, medicine and other domains can be formulated as optimization problems.

• 0,1 Matrices, Matroids
• The Packing Property
• A Characterization of Weakly Bipartite Graphs
• Bipartite Designs
• Characterizing Noninteger Polyhedra with 0-1 Constraints
• A Theorem of Truemper
• The Generalized Stable Set Problem for Claw-Free Bidirected Graphs
• On a Min-max Theorem of Cacti
• Edge Connectivity
• Edge-Splitting and Edge-Connectivity Augmentation in Planar Graphs
• A New Bound for the 2-Edge Connected Subgraph Problem
• An Improved Approximation Algorithm for Minimum Size 2-Edge Connected Spanning Subgraphs
• Algorithms
• Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width
• Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs
• Approximation Algorithms for the Mixed Postman Problem
• Improved Approximation Algorithms for Uncapacitated Facility Location
• The Maximum Traveling Salesman Problem Under Polyhedral Norms
• Integer Programming Applications
• Polyhedral Combinatorics of Benzenoid Problems
• Consecutive Ones and a Betweenness Problem in Computational Biology
• Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables
• Integer Programming Computation
• The Intersection of Knapsack Polyhedra and Extensions
• New Classes of Lower Bounds for Bin Packing Problems
• Solving Integer and Disjunctive Programs by Lift and Project
• A Class of Hard Small 0
• 1 Programs
• Network Flows
• Building Chain and Cactus Representations of All Minimum Cuts from Hao-Orlin in the Same Asymptotic Run Time
• Simple Generalized Maximum Flow Algorithms
• The Pseudoflow Algorithm and the Pseudoflow-Based Simplex for the Maximum Flow Problem
• An Implementation of a Combinatorial Approximation Algorithm for Minimum-Cost Multicommodity Flow
• Scheduling
• Non-approximability Results for Scheduling Problems with Minsum Criteria
• Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
• An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
• On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems
• Quadratic Assignment Problems
• Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations
• Incorporating Inequality Constraints in the Spectral Bundle Method.

This book constitutes the refereeed proceedings of the 6th International Conference on Integer Programming and Combinatorial Optimization, IPCO '98, held in Houston, Texas, USA, in June 1998. The 32 revised papers presented were carefully selected from a total of 77 submissions. The book is divided into sections on O/1 matrices and matroids, edge connectivity, algorithms, integer Programming computation, network flows, scheduling, and quadratic assignment problems.

• Algorithms and complexity
• Mathematical programming
• Operations research
• Stochastic optimization
• Graphs and combinatorics.

This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Symposium on Combinatorial Optimization, ISCO 2016, held in Vietri sul Mare, Italy, in May 2016. The 38 revised full papers presented in this book were carefully reviewed and selected from 98 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; and graphs and combinatorics.

• A forest exterior point algorithm for assignment problems, H. Achatz et al
• location/allocation of queuing facilities in continuous space using minsum and minimax criteria, J. Brimberg et al
• algorithms for the consistency analysis in scenario projects, R. Feldmann et al
• solving quadratic knapsack problems by reformulation and tabu search -single constraint case, F. Glover et al
• global optimization using dynamic search trajectories, A.A. Groenwold and J.A. Snyman
• on Pareto efficiency - a general constructive existence principle, G. Isac
• piecewise linear network flow problems, D. Kim and P.M. Pardalos
• semidefinite programming approaches for MAX-2-SAT and MAX-3-SAT - computational perspectives, E. de Klerk and J.P. Warners
• heuristic solutions of vehicle routing problems in supply chain management, Y. Marinakis and A. Migdalas
• a new finite cone covering algorithm for concave minimization, C. Meyer and B. Jaumard
• frequency assignment for very large, sparse networks, R. Murphey
• GPS network design - an application of the simulated annealing heuristic technique, H.A. Saleh and P.J. Dare
• normal branch and bound algorithms for general nonconvex quadratic programming, H. Tuy. (Part contents).
• (source: Nielsen Book Data)

Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on "Combinatorial and Global Optimization" held at Crete, Greece.
(source: Nielsen Book Data)

• Polyhedral Combinatorics.- Integer Programming.- Scheduling.- Matching.- Network Design.- Heuristics.
• (source: Nielsen Book Data)

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Combinatorial Optimization, ISCO 2020, which was due to be held in Montreal, Canada, in May 2020. The conference was held virtually due to the COVID-19 pandemic. The 24 revised full papers presented in this book were carefully reviewed and selected from 66 submissions.They were organized in the following topical sections: polyhedral combinatorics; integer programming; scheduling; matching; Network Design; Heuristics.
(source: Nielsen Book Data)

• Intro; Preface; Organization; Contents; On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming; 1 Introduction; 2 Proof of Theorem1; 2.1 Approximation in the Inner Region; 2.2 Decomposition of the Outer Region; References; Centerpoints: A Link Between Optimization and Convex Geometry; 1 Introduction; 2 An Application to Mixed-Integer Optimization; 3 General Properties; 4 Specialized Properties; 5 Computational Aspects; 5.1 Exact Algorithms; 5.2 Approximation Algorithms; References; Rescaled Coordinate Descent Methods for Linear Programming; 1 Introduction; 2 Algorithm 1

• 3 Algorithm
• 2: A Dual Chubanov Algorithm3.1 Refinements; References; Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems; 1 Introduction; 2 An LP-Relaxation for MCCST and Preliminaries; 3 An LP-Rounding Approximation Algorithm; 3.1 An Overview; 3.2 Algorithm Details and Analysis; 4 A Reduction from Weighted to Unweighted Problems; 5 Towards a -Approximation Algorithm for (QP); References; Max-Cut Under Graph Constraints; 1 Introduction; 1.1 Our Results and Techniques; 1.2 Related Work; 2 Preliminaries; 3 Approximation Algorithm for GCMC

• 3.1 Linear Program3.2 The Rounding Algorithm; 3.3 Algorithm Analysis; References; Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem; 1 Introduction; 2 Preliminaries; 2.1 The Chinese Postman Problem and Minimum T-joins; 3 Sparsest Cut in Planar Graphs; 4 Graphs with no K5 Minor; 5 Maximum Concurrent Flow; 5.1 Planar Graphs; 5.2 Graphs with no K5 Minor; References; Intersection Cuts for Bilevel Optimization; 1 Introduction; 2 Literature Overview; 3 Bilevel-Free Sets; 4 Mixed-Integer Bilevel Linear Programming; 5 A New Family of Cuts for MIBLP

• 6 Informed No-Good Cuts7 Preliminary Computational Results; References; Exact Algorithms for the Chance-Constrained Vehicle Routing Problem; 1 Introduction; 2 Problem Definition and an Edge-Based Formulation; 2.1 Edge-Based Formulation; 2.2 Vehicle Requirements in the Capacity Inequalities; 2.3 Joint Normal Random Demands; 3 Dantzig-Wolfe Formulation; 3.1 Relaxed Pricing; 3.2 Relaxed Pricing for Joint Normal Demands; 4 Computational Experiments; 4.1 Comparison of the CCVRP with Recourse Models; 5 Conclusion; References; Extended Formulations in Mixed-Integer Convex Programming; 1 Introduction

• 2 Extended Formulations and Conic Representability3 An Outer-Approximation Algorithm for Mixed-Integer Conic Programming; 4 Extended Formulations and Disciplined Convex Programming; 5 Computational Results; References; k-Trails: Recognition, Complexity, and Approximations; 1 Introduction; 1.1 Our Results; 2 Recognition of k-Trails; 3 Containment of Minimum Weight k-Trails; References; Better s-t-Tours by Gao Trees; 1 Introduction; 1.1 Previous Work; 1.2 Notation and Preliminaries; 1.3 Best-of-Many Christofides; 1.4 Gao Trees; 1.5 Our Contribution; 2 Proof of the Structure Theorem

This book constitutes the refereed proceedings of the 18th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2016, held in Liège, Belgium, in June 2016. The 33 full papers presented were carefully reviewed and selected from 125 submissions. The conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, computation, and applications in these areas. The scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

• Invited Lecture.- Matchings in Graphs Variations of the Problem.- Combinatorics from Bacterial Genomes.- Contributed Papers.- An Algorithm for Computing Virtual Cut Points in Finite Metric Spaces.- Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes.- K-Connected Target Coverage Problem in Wireless Sensor Networks.- Searching Cycle-Disjoint Graphs.- An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan.- A New Dynamic Programming Algorithm for Multiple Sequence Alignment.- Energy Minimizing Vehicle Routing Problem.- On the On-Line k-Taxi Problem with Limited Look Ahead.- The Minimum Risk Spanning Tree Problem.- The Size of a Minimum Critically m-Neighbor-Scattered Graph.- A New Hybrid Algorithm for Feature Selection and Its Application to Customer Recognition.- Steiner Forests on Stochastic Metric Graphs.- On Threshold BDDs and the Optimal Variable Ordering Problem.- Communication Leading to Nash Equilibrium Through Robust Messages - S5-Knowledge Model Case -.- Fundamental Domains for Integer Programs with Symmetries.- Exact Algorithms for Generalized Combinatorial Optimization Problems.- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders.- A Grid Resource Discovery Method Based on Adaptive k-Nearest Neighbors Clustering.- Algorithms for Minimum m-Connected k-Dominating Set Problem.- Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem.- Scaling, Renormalization, and Universality in Combinatorial Games: The Geometry of Chomp.- Mechanism Design by Creditability.- Infinite Families of Optimal Double-Loop Networks.- Point Sets in the Unit Square and Large Areas of Convex Hulls of Subsets of Points.- An Experimental Study of Compressed Indexing and Local Alignments of DNA.- Secure Multiparty Computations Using the 15 Puzzle.- A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem.- Single Machine Common Due Window Scheduling with Controllable Job Processing Times.- A Lower Bound on Approximation Algorithms for the Closest Substring Problem.- A New Exact Algorithm for the Two-Sided Crossing Minimization Problem.- Improved Approximation Algorithm for Connected Facility Location Problems.- The Computational Complexity of Game Trees by Eigen-Distribution.- The Minimum All-Ones Problem for Graphs with Small Treewidth.- An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem.- Arc Searching Digraphs Without Jumping.- On the Complexity of Some Colorful Problems Parameterized by Treewidth.- A PTAS for the Weighted 2-Interval Pattern Problem over the Preceding-and-Crossing Model.
• (source: Nielsen Book Data)

Running to almost 400 pages, and featuring more than 40 papers, this work on combinatorial optimization and applications will be seen as an important addition to the literature. It constitutes the refereed proceedings of the first International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August of that year. The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions and cover both theoretical issues and practical applications.
(source: Nielsen Book Data)

• Graph Theory.- Geometric Optimization.- Complexity and Data Structure.- Combinatorial Optimization.- Miscellaneous.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 10th International Conference on Combinatorial Optimization and Applications, COCOA 2016, held in Hong Kong, China, in December 2016. The 60 full papers included in the book were carefully reviewed and selected from 122 submissions. The papers are organized in topical sections such as graph theory, geometric optimization, complexity and data structure, combinatorial optimization, and miscellaneous.
(source: Nielsen Book Data)

• Finding Otimal Discretization Orders for Molecular Distance Geometry by Answer Set Programming
• Estimation of Edge Infection Probabilities in the Inverse Infection Problem
• On a Quantum Algorithm for the Resolution of Systems of Linear Equations
• Synthesis of Self-Adaptive Supervisors of Multi-Task Real-Time Object-Oriented Systems Using Developmental Genetic Programming
• Direct Shooting Method for Optimal Control of the Highly Nonlinear Differential-Algebraic Systems
• A Review on the Direct and Indirect Methods for Solving Optimal Control Problems with Differential-Algebraic Constraints
• InterCriteria Analysis of ACO and GA Hybrid Algorithms
• A Two-Stage Look-Ahead Heuristic for Packing Spheres into a Three-Dimensional Bin of Minimum Length
• Handling Lower Bound and Hill-Climbing Strategies for Sphere Packing Problems
• Multi-Objective Meta-Evolution Method for Large-Scale Optimization Problems
• Dispersive Flies Optimisation and Medical Imaging
• An Efficient Solution of the Resource Constrained Project Scheduling Problem Based on an Adaptation of the Developmental Genetic Programming
• Bayesian-Based Approach to Application of the Genetic Algorithm to Localize the Abrupt Atmospheric Contamination Source.

This volume is a comprehensive collection of extended contributions from the Workshop on Computational Optimization 2014, held at Warsaw, Poland, September 7-10, 2014. The book presents recent advances in computational optimization. The volume includes important real problems like parameter settings for controlling processes in bioreactor and other processes, resource constrained project scheduling, infection distribution, molecule distance geometry, quantum computing, real-time management and optimal control, bin packing, medical image processing, localization the abrupt atmospheric contamination source and so on. It shows how to develop algorithms for them based on new metaheuristic methods like evolutionary computation, ant colony optimization, constrain programming and others. This research demonstrates how some real-world problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks.

• A New Local Search Algorithm for the DNA Fragment Assembly Problem.- A Hybrid Immune-Based System for the Protein Folding Problem.- A Genetic Algorithm for the Resource Renting Problem with Minimum and Maximum Time Lags.- A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem.- Genetic Algorithms for Word Problems in Partially Commutative Groups.- A GRASP and Branch-and-Bound Metaheuristic for the Job-Shop Scheduling.- Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges.- Iterated k-Opt Local Search for the Maximum Clique Problem.- Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem.- Evolutionary Algorithms for Real-World Instances of the Automatic Frequency Planning Problem in GSM Networks.- A New Metaheuristic for the Vehicle Routing Problem with Split Demands.- Generation of Tree Decompositions by Iterated Local Search.- Edge Assembly Crossover for the Capacitated Vehicle Routing Problem.- Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms.- A Population-Based Local Search for Solving a Bi-objective Vehicle Routing Problem.- Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem.- Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling.- An Analysis of Problem Difficulty for a Class of Optimisation Heuristics.- A New Grouping Genetic Algorithm for the Quadratic Multiple Knapsack Problem.- A Hybrid Method for Solving Large-Scale Supply Chain Problems.- Crossover Operators for the Car Sequencing Problem.
• (source: Nielsen Book Data)

This book constitutes the refereed proceedings of the 7th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2007, held in Valencia, Spain in April 2007. The 21 revised full papers cover evolutionary algorithms as well as various other metaheuristics, like scatter search, tabu search, memetic algorithms, variable neighborhood search, ant colony optimization, and particle swarm optimization algorithms.
(source: Nielsen Book Data)

• Which are the most critical nodes in a network? A Basic Variable Neighborhood Search approach.- Variable Neighborhood Descent Branching applied to the Green Electric Vehicle Routing Problem with Time Window and Mixed Fleet.- A Variable Neighborhood Heuristic for Facility Locations in Fog Computing.- A GRASP/VND Heuristic for the Generalized Steiner Problem with Node-Connectivity Constraints and Hostile Reliability.- Max-Diversity Orthogonal Regrouping of MBA Students using a GRASP/VND Heuristic.- Scheduling in parallel machines with two servers: the restrictive case.- Reduced Variable Neighbourhood Search for the generation of controlled circular data.- Sequential and Parallel Scattered Variable Neighborhood Search for Solving Nurikabe.- A Hybrid VNS for the Multi-Product Maritime Inventory Routing Problem.- Simplicial vertex heuristic in solving the Railway arrival and departure paths assignment problem.- Scheduling of Patients in Emergency Departments with a Variable Neighborhood Search.- A GRASP/VND Heuristic for the Heterogeneous Fleet Vehicle Routing Problem with Time Windows.- Using K-means and Variable Neighborhood Search for Automatic Summarization of Scientific Articles.- BVNS approach for the Order Processing in Parallel Picking Workstations .
• (source: Nielsen Book Data)

This volume constitutes the proceedings of the 8th International Conference on Variable Neighborhood Search, ICVNS 2021, held in Abu Dhabi, United Arab Emirates, in March 2021.The 14 full papers presented in this volume were carefully reviewed and selected from 27 submissions. The papers describe recent advances in methods and applications of variable neighborhood search. Chapter "Reduced Variable Neighbourhood Search for the Generation of Controlled Circular Data" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.
(source: Nielsen Book Data)