1  20
Next
 EvoCOP (Conference) (2009 : Tübingen, Germany)
 Berlin : Springer, ©2009.
 Description
 Book — 1 online resource (xiv, 251 pages) : illustrations Digital: text file.PDF.
 Summary

 A Critical ElementGuided 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 MultiMode ResourceConstrained Project Scheduling Problem. BeamACO 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 MultiParent Recombination for Evolutionary Graph Coloring Algorithms. DivideAndEvolve Facing StateoftheArt Temporal Planners during the 6 th International Planning Competition. Exact Solutions to the Traveling Salesperson Problem by a PopulationBased 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 MultiObjective 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)
(source: Nielsen Book Data)
 COCOA (Conference) (3rd : 2009 : Huangshan Shi, China)
 Berlin ; New York : Springer, ©2009.
 Description
 Book — 1 online resource (xiii, 542 pages) : illustrations Digital: text file.PDF.
 Summary

 Algorithms for Network Design. Polynomial Approximation Schemes for the MaxMin 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/3Approximation Algorithm for Joint Replenishment with Deadlines. A PTAS for NodeWeighted Steiner Tree in Unit Disk Graphs. Bioinformatics. DNA Library Screening, Pooling Design and Unitary Spaces. Improved Algorithms for the Gene Team Problem. Linear Coherent Bicluster 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 RectangleofInfluence Drawings of Planar Graphs. An Effective Hybrid Algorithm for the Circles and Spheres Packing Problems. VariableSize Rectangle Covering. OnLine MultipleStrip Packing. Game Theory. A CostSharing Method for the SoftCapacitated Economic LotSizing Game. Improved Bounds for Facility Location Games with Fair Cost Allocation. Graph Algorithms. TwoLevel Heaps: A New Priority Queue Structure with Applications to the Single Source Shortest Path Problem. On Construction of AlmostRamanujan Graphs. A 2log2(n)Approximation Algorithm for Directed Tour Cover. Approximation Algorithms for Max 3Section Using Complex Semidefinite Programming Relaxation. Graph Theory. Hamiltonian Decomposition of Some Interconnection Networks. Infinite Family from Each Vertex kCritical 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 nCritical Bipartite Graphs and Its Application. Network Models and Problems. RealTime Algorithm Scheme for nVehicle Exploration Problem. Deterministically Estimating Data Stream Frequencies. Positive Influence Dominating Set in Online Social Networks. Online Algorithms. Optimal Algorithms for the Online Time Series Search Problem. A RiskReward Competitive Analysis for the Newsboy Problem with Range Information. Optimal Semionline Algorithm for Scheduling on a Batch Processing Machine. A Note on Online Scheduling for Jobs with Arbitrary Release Times. SizeProblems. SizeConstrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast kTree Routing Problem. On Disjoint Shortest Paths Routing on the Hypercube. A New Approach for Rearrangeable Multicast Switching Networks. Scheduling. Bicriteria Scheduling on SingleMachine 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. FaultTolerant Routing: kInconnected ManytoOne Routing in Wireless Networks. A BranchandCut 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)
(source: Nielsen Book Data)
 CologneTwente Workshop on Graphs and Combinatorial Optimization (18th : 2020 : Online)
 Cham : Springer, [2021]
 Description
 Book — 1 online resource (408 pages)
 Summary

 W. Hochstattler and J. Wiehe, The Chromatic Polynomial of a Digraph. J. Diaz et al., On List kColoring 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 LinearTime FPT Algorithm. H. Kerivin and A. Wagler, On superperfection of edge intersection graphs of paths. L. Liberti et al., A cyclebased 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 directionlength frameworks. M. Hiller et al., On the Burning Number of pCaterpillars. 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 MultiObjective LocationRouting 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., Startup/Shutdown MINLP formulations for the Unit Commitment with Ramp Constraints. J. Lee et al., Gaining or Losing Perspective for PiecewiseLinear UnderEstimators of Convex Univariate Functions. M. Aprile et al., Recognizing Cartesian products of matrices and polytopes. A. Frank, Special subclass of Generalized SemiMarkov Decision Processes with discrete time. R. Seccia et al., Coupling Machine Learning and Integer Programming for Optimal TV Promo Scheduling. F. MendozaGranada and M. Villagra, A Distributed Algorithm for Spectral Sparsification of Graphs with Applications to Data Clustering.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Workshop on Computational Optimization (2020)
 Cham : Springer, [2022]
 Description
 Book — 1 online resource (487 pages) : illustrations (some color) Digital: text file.PDF.
 Summary

 Statistical Measurements of Metaheuristics for Solving Engineering Problems. Heuristic Approaches for the Stochastic MultiDepot Vehicle Routing Problem with Pickup and Delivery. Evaluation of MOACO Algorithms Using a New Fast InterCriteria Analysis Method. Semantic Graph Queries on Linked Data in Knowledge Graphs. Online SingleMachine 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 TwoStage 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 Firsttype Error Rate of the Logrank Test: Asymptotic Time Complexity Analysis of an Optimized Test's Alternative. Zero Point Approach to ThreeDimensional Intuitionistic Fuzzy Transportation Problem. On IndexMatrix Interpretation of IntervalValued Intuitionistic Fuzzy Hamiltonian Cycle. On the Conceptual Optimization of Generalized Net Models. Sensitivity Study of a LargeScale Air Pollution Model by Using Optimized Latin Hyprecube Sampling. Optimized QuasiMonte 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)
(source: Nielsen Book Data)
 Workshop on Computational Optimization (2019 : Leipzig, Germany)
 Cham : Springer, [2021]
 Description
 Book — 1 online resource (203 pages) Digital: text file.PDF.
 Summary

 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 SetCover Structures with Several Constraints for Knowledge Discovery on Large Literature Databases. Evaluation of optimal charging station location for electric vehicles: an Italian casestudy. 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 1space bounded cube packing and 2space bounded hypercube packing.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Conference on Integer Programming and Combinatorial Optimization (22nd : 2021 : Online)
 Cham : Springer, 2021.
 Description
 Book — 1 online resource (500 pages)
 Summary

 Improving the Approximation Ratio for Capacitated Vehicle Routing. Online kTaxi via Double Coverage and TimeReverse PrimalDual. Approximating the discrete timecost tradeoff problem with bounded depth. Sumofsquares 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. Multicover Inequalities for TotallyOrdered Multiple Knapsack Sets. SemiStreaming 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 kCenter with Two Types of Radii. SpeedRobust Scheduling  Rocks, Bricks, and Sand. The Double Exponential Runtime is Tight for 2Stage Stochastic ILPs. Fast Quantum Subroutines for the Simplex Method. Maximum Weight Disjoint Paths in Outerplanar Graphs via SingleTree Cut Approximators. A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. Fixed Parameter Approximation Scheme for Minmax kcut. Computational Aspects of Relaxation Complexity. Complexity of branchandbound and cutting planes in mixedinteger optimization  II. Face Dimensions of GeneralPurpose Cutting Planes for MixedInteger 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)
(source: Nielsen Book Data)
 Conference on Integer Programming and Combinatorial Optimization (21st : 2020 : London, England)
 Cham : Springer, 2020.
 Description
 Book — 1 online resource (459 pages) Digital: text file.PDF.
 Summary

 Idealness of kwise intersecting families. Flexible Graph Connectivity: Approximating Network Design Problems Between
 1 and 2connectivity. Faster Algorithms for Parametric Global Minimum Cut Problems. Optimizing Sparsity over Lattices and Semigroups. A Technique for Obtaining True Approximations for kCenter with Covering Constraints. Tight Approximation Bounds for Maximum MultiCoverage. 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 atalGomory closure. Algorithms for ows over time with scheduling costs. Integer Plane Multi ow Maximisation: FlowCut Gap and OneQuarterApproximation. Stochastic Makespan Minimization in Structured Set Systems. Continuous facility location on graphs. Recognizing evencycle and evencut matroids. A combinatorial algorithm for computing the rank of a generic partitioned matrix with $2 ntimes 2$ submatrices. Fair Colorful kCenter Clustering. Popular Branchings and Their Dual Certi cates. Sparse graphs and an augmentation problem. About the Complexity of TwoStage Stochastic Ips. Packing under Convex Quadratic Constraints. Weighted Trianglefree 2matching Problem with Edgedisjoint Forbidden Triangles. Single source unsplittable ows with arcwise lower and upper bounds. Maximal quadraticfree sets. On Generalized Surrogate Duality in MixedInteger 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 latticefree 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)
(source: Nielsen Book Data)
 Berlin ; London : Springer, ©2010.
 Description
 Book — 1 online resource (xx, 803 pages) : illustrations
 Summary

 Cover
 Contents
 Part I: The Early Years
 1 Solution of a LargeScale TravelingSalesman 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 StateoftheArt
 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 mixedinteger inequalities
 11.6 Polyhedrality of closures
 11.7 Liftandproject
 11.8 Rank
 References
 12 FiftyPlus Years of Combinatorial Integer Programming
 12.1 Combinatorial integer programming
 12.2 The TSP in the 1950s
 12.3 Proving theorems with linearprogramming duality
 12.4 Cuttingplane computation
 12.5 Jack Edmonds, polynomialtime 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 nonisomorphic solutions
 17.12 Furthering the reach of isomorphism pruning
 17.13 Choice of f.
(source: Nielsen Book Data)
 International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems (6th : 2009 : Pittsburgh, Pa.)
 Berlin ; New York : Springer, ©2009.
 Description
 Book — 1 online resource (xi, 332 pages) : illustrations (some color) Digital: text file.PDF.
 Summary

 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 Nonoverlapping Constraints. Throughput Constraint for Synchronous Data Flow Graphs. A Shortest PathBased Approach to the Multileaf Collimator Sequencing Problem. Backdoors to Combinatorial Optimization: Feasibility and Optimality. Solution Enumeration for Projected Boolean Search Problems. kClustering 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 multicostregular Constraint. BandwidthLimited Optimal Deployment of EventuallySerializable Data Services. Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming. The Polytope of ContextFree 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 LogTruck Scheduling Problem. Modelling Search Strategies in Rules2CP. CPINSIDE: Embedding ConstraintBased 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)
(source: Nielsen Book Data)
 Workshop on Computational Optimization (2015 : Lodz, Poland)
 Switzerland : Springer, 2016.
 Description
 Book — 1 online resource
 Summary

 Fast OutputSensitive 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 CahnHilliard 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.
 Conference on Integer Programming and Combinatorial Optimization (6th : 1998 : Houston, Tex.)
 Berlin ; New York : Springer, ©1998.
 Description
 Book — 1 online resource (ix, 435 pages) : illustrations Digital: text file.PDF.
 Summary

 0,1 Matrices, Matroids
 The Packing Property
 A Characterization of Weakly Bipartite Graphs
 Bipartite Designs
 Characterizing Noninteger Polyhedra with 01 Constraints
 A Theorem of Truemper
 The Generalized Stable Set Problem for ClawFree Bidirected Graphs
 On a Minmax Theorem of Cacti
 Edge Connectivity
 EdgeSplitting and EdgeConnectivity Augmentation in Planar Graphs
 A New Bound for the 2Edge Connected Subgraph Problem
 An Improved Approximation Algorithm for Minimum Size 2Edge Connected Spanning Subgraphs
 Algorithms
 Multicuts in Unweighted Graphs with Bounded Degree and Bounded TreeWidth
 Approximating DisjointPath 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 HaoOrlin in the Same Asymptotic Run Time
 Simple Generalized Maximum Flow Algorithms
 The Pseudoflow Algorithm and the PseudoflowBased Simplex for the Maximum Flow Problem
 An Implementation of a Combinatorial Approximation Algorithm for MinimumCost Multicommodity Flow
 Scheduling
 Nonapproximability 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 LPBased Approaches to NPHard Scheduling Problems
 Quadratic Assignment Problems
 Polyhedral Combinatorics of Quadratic Assignment Problems with Less Objects than Locations
 Incorporating Inequality Constraints in the Spectral Bundle Method.
 ISCO (Symposium : Combinatorial optimization) (4th : 2016 : Vietri sul Mare, Italy)
 Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xx, 452 pages) : illustrations Digital: text file.PDF.
 Summary

 Algorithms and complexity
 Mathematical programming
 Operations research
 Stochastic optimization
 Graphs and combinatorics.
13. Combinatorial and global optimization [2002]
 River Edge, NJ : World Scientific, ©2002.
 Description
 Book — 1 online resource (xvi, 355 pages) : illustrations, maps Digital: data file.
 Summary

 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 MAX2SAT and MAX3SAT  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)
(source: Nielsen Book Data)
 ISCO (Symposium : Combinatorial optimization) (6th : 2020 : Montréal, Québec)
 Cham : Springer, 2020.
 Description
 Book — 1 online resource
 Summary

 Polyhedral Combinatorics. Integer Programming. Scheduling. Matching. Network Design. Heuristics.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Conference on Integer Programming and Combinatorial Optimization (18th : 2016 : Liège, Belgium)
 Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xiii, 412 pages) : illustrations
 Summary

 Intro; Preface; Organization; Contents; On Approximation Algorithms for Concave MixedInteger 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 MixedInteger 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 MinCost ChainConstrained Spanning Trees: A Reduction from Weighted to Unweighted Problems; 1 Introduction; 2 An LPRelaxation for MCCST and Preliminaries; 3 An LPRounding 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; MaxCut 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 MaxCut Problem; 1 Introduction; 2 Preliminaries; 2.1 The Chinese Postman Problem and Minimum Tjoins; 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 BilevelFree Sets; 4 MixedInteger Bilevel Linear Programming; 5 A New Family of Cuts for MIBLP
 6 Informed NoGood Cuts7 Preliminary Computational Results; References; Exact Algorithms for the ChanceConstrained Vehicle Routing Problem; 1 Introduction; 2 Problem Definition and an EdgeBased Formulation; 2.1 EdgeBased Formulation; 2.2 Vehicle Requirements in the Capacity Inequalities; 2.3 Joint Normal Random Demands; 3 DantzigWolfe 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 MixedInteger Convex Programming; 1 Introduction
 2 Extended Formulations and Conic Representability3 An OuterApproximation Algorithm for MixedInteger Conic Programming; 4 Extended Formulations and Disciplined Convex Programming; 5 Computational Results; References; kTrails: Recognition, Complexity, and Approximations; 1 Introduction; 1.1 Our Results; 2 Recognition of kTrails; 3 Containment of Minimum Weight kTrails; References; Better stTours by Gao Trees; 1 Introduction; 1.1 Previous Work; 1.2 Notation and Preliminaries; 1.3 BestofMany Christofides; 1.4 Gao Trees; 1.5 Our Contribution; 2 Proof of the Structure Theorem
 COCOA (Conference) (1st : 2007 : Xi'an Shi, China)
 Berlin ; New York : Springer, ©2007.
 Description
 Book — 1 online resource (xi, 390 pages) : illustrations Digital: text file.PDF.
 Summary

 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 Antiblock Vital Edge of a Shortest Path Between Two Nodes. KConnected Target Coverage Problem in Wireless Sensor Networks. Searching CycleDisjoint 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 OnLine kTaxi Problem with Limited Look Ahead. The Minimum Risk Spanning Tree Problem. The Size of a Minimum Critically mNeighborScattered 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  S5Knowledge Model Case . Fundamental Domains for Integer Programs with Symmetries. Exact Algorithms for Generalized Combinatorial Optimization Problems. Approximation Algorithms for kDuplicates Combinatorial Auctions with Subadditive Bidders. A Grid Resource Discovery Method Based on Adaptive kNearest Neighbors Clustering. Algorithms for Minimum mConnected kDominating 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 DoubleLoop 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 TwoSided Crossing Minimization Problem. Improved Approximation Algorithm for Connected Facility Location Problems. The Computational Complexity of Game Trees by EigenDistribution. The Minimum AllOnes Problem for Graphs with Small Treewidth. An Exact Algorithm Based on Chain Implication for the MinCVCB Problem. Arc Searching Digraphs Without Jumping. On the Complexity of Some Colorful Problems Parameterized by Treewidth. A PTAS for the Weighted 2Interval Pattern Problem over the PrecedingandCrossing Model.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 COCOA (Conference) (10th : 2016 : Hong Kong, China)
 Cham, Switzerland : Springer, 2016.
 Description
 Book — 1 online resource (xv, 793 pages) : illustrations Digital: text file.PDF.
 Summary

 Graph Theory. Geometric Optimization. Complexity and Data Structure. Combinatorial Optimization. Miscellaneous.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Workshop on Computational Optimization (2014 : Warsaw, Poland)
 Cham : Springer, [2015]
 Description
 Book — 1 online resource (x, 244 pages) : illustrations (some color)
 Summary

 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 SelfAdaptive Supervisors of MultiTask RealTime ObjectOriented Systems Using Developmental Genetic Programming
 Direct Shooting Method for Optimal Control of the Highly Nonlinear DifferentialAlgebraic Systems
 A Review on the Direct and Indirect Methods for Solving Optimal Control Problems with DifferentialAlgebraic Constraints
 InterCriteria Analysis of ACO and GA Hybrid Algorithms
 A TwoStage LookAhead Heuristic for Packing Spheres into a ThreeDimensional Bin of Minimum Length
 Handling Lower Bound and HillClimbing Strategies for Sphere Packing Problems
 MultiObjective MetaEvolution Method for LargeScale 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
 BayesianBased Approach to Application of the Genetic Algorithm to Localize the Abrupt Atmospheric Contamination Source.
 EvoCOP (Conference) (7th : 2007 : Valencia, Spain)
 Berlin ; New York : Springer, ©2007.
 Description
 Book — 1 online resource (xii, 239 pages) : illustrations
 Summary

 A New Local Search Algorithm for the DNA Fragment Assembly Problem. A Hybrid ImmuneBased 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 BranchandBound Metaheuristic for the JobShop Scheduling. Reducing the Size of Traveling Salesman Problem Instances by Fixing Edges. Iterated kOpt Local Search for the Maximum Clique Problem. Accelerating Local Search in a Memetic Algorithm for the Capacitated Vehicle Routing Problem. Evolutionary Algorithms for RealWorld 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 PopulationBased Local Search for Solving a Biobjective 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 LargeScale Supply Chain Problems. Crossover Operators for the Car Sequencing Problem.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 ICVNS (Conference) (8th : 2021 : Abū Ẓaby, United Arab Emirates)
 Cham : Springer, [2021]
 Description
 Book — 1 online resource (202 pages)
 Summary

 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 NodeConnectivity Constraints and Hostile Reliability. MaxDiversity 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 MultiProduct 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 Kmeans and Variable Neighborhood Search for Automatic Summarization of Scientific Articles. BVNS approach for the Order Processing in Parallel Picking Workstations .
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.