Linked e-resources
Details
Table of Contents
Preface; Contents; Part I Award Winners; Exploiting Solving Phases for Mixed-Integer Programs; 1 Introduction; 2 Solving Phases in Mixed Integer Programming; 3 Heuristic Phase Transitions; 4 Computational Results; 5 Conclusions; References; An Extended Formulation for the Line Planning Problem; 1 Introduction; 2 Standard Model and Extended Formulation; 2.1 Model Comparison; 3 Multi-edge Configuration; References; Improving the Performance of MIP and MINLP Solvers by Integrated Heuristics; 1 Introduction; 2 Shift-and-Propagate; 3 An Objective Feasibility Pump for Nonconvex MINLP.
4 Large Neighborhood Search: From MIP to MINLP5 RENS: The Optimal Rounding; 6 Undercover: The Smallest Sub-MIP; 7 Rapid Learning: A New CP/MIP Hybrid; 8 Cloud Branching: Exploiting Dual Degeneracy; 9 The Impact of Primal Heuristics; References; Part II Discrete Optimization, Integer Programming, Graphs and Networks; An Experimental Study of Algorithms for Controlling Palletizers; 1 Introduction; 2 Solutions of the FIFO Stack-Up Problem; 3 Experimental Study; References; Robust Two-Stage Network Problems; 1 Introduction; 2 Problem Formulation; 3 Interval Uncertainty Representation.
4 Discrete Uncertainty RepresentationReferences; Composed Min-Max and Min-Sum Radial Approach to the Emergency System Design; 1 Introduction; 2 Composition of Min-Max and Min-Sum Optimization Methods; 3 Computational Study; 4 Conclusions; References; LP-Based Relaxations of the Skiving Stock Problem
Improved Upper Bounds for the Gap; 1 Introduction; 2 Preliminaries; 3 Residual Instances; 4 Improved Upper Bounds for the Gap; 5 Conclusions and Outlook; References; Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem; 1 Introduction.
2 Modelling Upper Bounds for the SPP2.1 Basic Model; 2.2 Next-Fit Decreasing-Height; 2.3 First-Fit Decreasing-Height; 2.4 Best-Fit Decreasing-Height; 3 Conclusions and Outlook; References; The Maximum Scatter TSP on a Regular Grid; 1 Introduction; 2 The Algorithm; 3 Optimality and Gaps; 4 Conclusion; References; Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem; 1 Introduction; 2 Contiguous 1D Cutting Patterns; 3 2D-Feasible 1D Cutting Patterns; 4 Numerical Experiments and Conclusions; References.
Computing Partitions with Applications to Capital Budgeting Problems1 Introduction; 2 Pseudo-polynomial Algorithms; 3 Parameterized Algorithms; References; Upper Bound for the Capacitated Competitive Facility Location Problem; 1 Introduction; 2 Mathematical Model; 3 Upper Bound; 4 Conclusion; References; The Onset of Congestion in Charging of Electric Vehicles for Proportionally Fair Network Management Protocol; 1 Introduction; 2 Optimization Model; 3 Results; 3.1 Numerical Experiments; 3.2 Onset of Congestion in 2-Edge Network; 4 Conclusions; References.
4 Large Neighborhood Search: From MIP to MINLP5 RENS: The Optimal Rounding; 6 Undercover: The Smallest Sub-MIP; 7 Rapid Learning: A New CP/MIP Hybrid; 8 Cloud Branching: Exploiting Dual Degeneracy; 9 The Impact of Primal Heuristics; References; Part II Discrete Optimization, Integer Programming, Graphs and Networks; An Experimental Study of Algorithms for Controlling Palletizers; 1 Introduction; 2 Solutions of the FIFO Stack-Up Problem; 3 Experimental Study; References; Robust Two-Stage Network Problems; 1 Introduction; 2 Problem Formulation; 3 Interval Uncertainty Representation.
4 Discrete Uncertainty RepresentationReferences; Composed Min-Max and Min-Sum Radial Approach to the Emergency System Design; 1 Introduction; 2 Composition of Min-Max and Min-Sum Optimization Methods; 3 Computational Study; 4 Conclusions; References; LP-Based Relaxations of the Skiving Stock Problem
Improved Upper Bounds for the Gap; 1 Introduction; 2 Preliminaries; 3 Residual Instances; 4 Improved Upper Bounds for the Gap; 5 Conclusions and Outlook; References; Creating Worst-Case Instances for Upper and Lower Bounds of the Two-Dimensional Strip Packing Problem; 1 Introduction.
2 Modelling Upper Bounds for the SPP2.1 Basic Model; 2.2 Next-Fit Decreasing-Height; 2.3 First-Fit Decreasing-Height; 2.4 Best-Fit Decreasing-Height; 3 Conclusions and Outlook; References; The Maximum Scatter TSP on a Regular Grid; 1 Introduction; 2 The Algorithm; 3 Optimality and Gaps; 4 Conclusion; References; Using Contiguous 2D-Feasible 1D Cutting Patterns for the 2D Strip Packing Problem; 1 Introduction; 2 Contiguous 1D Cutting Patterns; 3 2D-Feasible 1D Cutting Patterns; 4 Numerical Experiments and Conclusions; References.
Computing Partitions with Applications to Capital Budgeting Problems1 Introduction; 2 Pseudo-polynomial Algorithms; 3 Parameterized Algorithms; References; Upper Bound for the Capacitated Competitive Facility Location Problem; 1 Introduction; 2 Mathematical Model; 3 Upper Bound; 4 Conclusion; References; The Onset of Congestion in Charging of Electric Vehicles for Proportionally Fair Network Management Protocol; 1 Introduction; 2 Optimization Model; 3 Results; 3.1 Numerical Experiments; 3.2 Onset of Congestion in 2-Edge Network; 4 Conclusions; References.