Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June 1, 2012, Proceedings / / edited by Nicolas Beldiceanu, Narendra Jussien, Eric Pinson
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June 1, 2012, Proceedings / / edited by Nicolas Beldiceanu, Narendra Jussien, Eric Pinson |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XI, 409 p. 69 illus.) |
| Disciplina | 519.6/4 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Numerical analysis
Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Numerical Analysis Discrete Mathematics in Computer Science Artificial Intelligence Operations Research and Decision Theory |
| ISBN | 3-642-29828-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465553903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Operations Research and Enterprise Systems : Third International Conference, ICORES 2014, Angers, France, March 6-8, 2014, Revised Selected Papers / / edited by Eric Pinson, Fernando Valente, Begoña Vitoriano
| Operations Research and Enterprise Systems : Third International Conference, ICORES 2014, Angers, France, March 6-8, 2014, Revised Selected Papers / / edited by Eric Pinson, Fernando Valente, Begoña Vitoriano |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XII, 301 p. 61 illus.) |
| Disciplina | 658.4034 |
| Collana | Communications in Computer and Information Science |
| Soggetto topico |
Computer science—Mathematics
Application software Information technology Business—Data processing Production management Mathematics of Computing Information Systems Applications (incl. Internet) Computer Applications IT in Business Operations Management |
| ISBN | 3-319-17509-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Intro -- Preface -- Organization -- Contents -- Invited Paper -- Learning Tabu Search for Combinatorial Optimization -- 1 Introduction -- 2 Learning Tabu Search (LTS) -- 3 LTS for a Refueling Problem in a Railway Network -- 4 Conclusion -- References -- Methodologies and Technologies -- Four Serious Problems and New Facts of the Discriminant Analysis -- Abstract -- 1 Introduction -- 2 Discriminant Functions -- 2.1 Statistical Discriminant Functions -- 2.2 Before and After SVM -- 2.3 IP-OLDF and Revised IP-OLDF -- 3 The Unresolved Problem (Problem 1) -- 3.1 Perception Gap of This Problem -- 3.2 The Student Data -- 4 The Discrimination of Linear Separable Data (Problem 2) -- 4.1 The Importance of This Problem -- 4.2 Pass/Fail Determination -- 4.3 Discrimination by Four Testlets -- 5 Problem 3 (Discrimination of 44 Japanese Cars) -- 6 K-fold Cross Validation (Problem 4) -- 6.1 Hundred-Fold Cross Validation -- 6.2 LOO and K--Fold Cross Validation -- 7 Conclusions -- References -- Simulated Annealing Algorithm for Job Shop Scheduling on Reliable Real-Time Systems -- Abstract -- 1 Introduction -- 2 Problem Formulation -- 3 Proposed Problem Solution -- 3.1 Selecting the Method -- 3.2 Simulated Annealing Algorithm Description -- 4 Experiments -- 5 Conclusions -- References -- Nash Equilibria for Multi-agent Network Flow with Controllable Capacities -- 1 Introduction -- 2 Problem Statement and Notations -- 2.1 Problem Definition -- 2.2 Mathematical Formulation -- 3 Efficiency vs. Stability -- 4 Case Analysis -- 4.1 The Single-Agent Case -- 4.2 The Multi-agent Case -- 4.3 The Special Case |Eu|=1, Au -- 5 Problem Complexity -- 5.1 Finding a Feasible Solution -- 5.2 Finding a Nash Equilibrium with Bounded Flow -- 6 Conclusions -- References -- A Fuzzy Model for Selecting Safeguards to Reduce Risks in Information Systems -- 1 Introduction.
2 Selection of Preventive Safeguards -- 3 An Illustrative Example -- 4 Conclusions -- References -- A Performance Improvement and Management Model for Small and Medium Sized Enterprises -- Abstract -- 1 Introduction -- 2 Performance Measurement Systems in SME -- 3 SME and the Challenges -- 4 Analytical Hierarchy Process (AHP) -- 5 SCOR Performance Levels and Attributes -- 6 The Approach -- 7 Case Study -- 8 Results and Discussion -- 9 Conclusion -- References -- Adjacency Variables Formulation for the Minimum Linear Arrangement Problem -- 1 Introduction -- 2 A Linear Formulation with O(n2) Variables -- 3 Lifting Valid Inequalities -- 4 Degree Valid Equalities -- 5 Partitioning Cuts -- 5.1 Separation Problem -- 5.2 Cutting Planes Algorithm -- 5.3 Solving the Graph Partitioning Problem -- 6 Numerical Experiments -- 7 Conclusion and Perspectives -- References -- A Vessel Scheduling Problem with Special Cases -- 1 Introduction -- 2 Problem Definition -- 3 Special Cases -- 3.1 Backward Heuristic -- 3.2 Greedy Heuristic -- 3.3 Improved Greedy Heuristic -- 3.4 Bender's Type Decomposition Approach -- 4 Computational Results -- 5 Delivery with Time-Windows -- 5.1 Formulation -- 6 Conclusions -- References -- Archimedean Copulas in Joint Chance-Constrained Programming -- 1 Introduction -- 2 Dependence -- 2.1 Basic Facts About Copulas -- 2.2 Introducing Normal Distribution -- 2.3 Convexity -- 3 Main Result -- 3.1 Convex Reformulation -- 3.2 SOCP Approximation -- 4 Conclusions -- References -- Comparison of Stochastic Programming Approaches for Staffing and Scheduling Call Centers with Uncertain Demand Forecasts -- 1 Introduction -- 2 Staffing Problem Modeling -- 3 Problem Formulation -- 4 Solution Approximations -- 4.1 Definition of Function -- 4.2 Convexity of y FBt-1(py) -- 4.3 Piecewise Linear Approximation -- 4.4 Piecewise Tangent Approximation. 5 Numerical Experiments -- 5.1 Instance -- 5.2 Comparison with Other Programs -- 5.3 Results -- 6 Staffing and Scheduling Problems in Two Steps -- 6.1 The Requirements Bt as Random Normal Variables -- 6.2 Results Comparison -- 7 Conclusion -- References -- A New Look at the Covariance Matrix Estimation in Evolution Strategies -- 1 Introduction -- 1.1 Evolution Strategies -- 1.2 Covariance Matrix Adaptation -- 1.3 Step-Size Adaptation -- 2 Concerning the Covariance Estimator -- 3 Approaches for Estimating the Covariance -- 3.1 Shrinkage Estimators -- 3.2 A Maximum Entropy Covariance Estimation -- 3.3 New Covariance Estimators -- 4 Experimental Evaluation -- 4.1 Test Suite -- 4.2 Performance Measure -- 4.3 Results and Discussion -- 5 Conclusions -- References -- A Relax and Fix Approach to Solve the Fixed Charge Network Design Problem with User-Optimal Flow -- 1 Introduction -- 2 General Description of the FCNDP-UOF -- 2.1 Mathematical Formulation -- 3 Solution Approach -- 3.1 Partial Decoupling Heuristic -- 3.2 Relax and Fix Heuristic -- 3.3 PDRF -- 4 Computational Results -- 4.1 Statistical Analysis -- 5 Conclusion and Future Works -- References -- Analysis of a Downward Substitution Strategy in a Manufacturing/Remanufacturing System -- Abstract -- 1 Introduction -- 2 Literature Review -- 3 Problem Description -- 4 Numerical Experiments and Results -- 5 Conclusions -- Acknowledgements -- References -- Risk Tolerance Evaluation for an Oil and Gas Company Using a Multi-criteria Approach -- Abstract -- 1 Introduction -- 2 Problem Formulation -- 2.1 Physical Earnings Formulation -- 2.2 Derivatives Payout Formulation -- 2.3 Company Earnings Formulation -- 3 Prices Modeling -- 4 Risk Modelling -- 4.1 Risk Measures -- 4.2 Risk Tolerance -- 4.3 Risk Tolerance Evaluation Methods -- 5 Optimization Results -- 6 Multi-criteria Evaluation -- 7 Conclusions. References -- A Mathematical Programming Model for the Real Time Traffic Management of Railway Networks Under Disturbances -- 1 Introduction -- 2 Problem Formalization -- 2.1 Initial Scheduling -- 2.2 Disturbances Issues -- 3 Mathematical Modeling -- 3.1 Decision Variables -- 3.2 Linearization of Safety Constraints -- 3.3 Objective Functions -- 4 Numerical Experiments -- 4.1 One Disturbance on the Line -- 4.2 Two Disturbances on the Line -- 5 Conclusions and Perspectives -- References -- Applications -- Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities -- 1 Introduction -- 2 MILP Formulation -- 2.1 Initial MILP Formulation -- 2.2 Single-Product Valid Inequalities -- 3 New Multi-product Valid Inequalities -- 4 Separation Problem -- 4.1 Exact Separation Algorithm -- 4.2 Heuristic Separation Algorithm -- 4.3 Cutting-Plane Generation Algorithm -- 5 Computational Results -- 6 Conclusions -- References -- A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign -- 1 Introduction -- 2 Formal Problem Formulation -- 3 Quadratic Knapsack Model -- 4 Linear and Quadratic Effect Estimation -- 4.1 Considering Similarity of Campaigns -- 4.2 Estimation of Media Interaction -- 5 Budget Allocation -- 5.1 Estimation of Budget Values -- 5.2 Actual Budget Allocation -- 6 Memory Perspective -- 7 Solution of the Quadratic Knapsack Problem -- 8 Conclusions -- References -- A Decomposition Approach to Solve Large-Scale Network Design Problems in Cylinder Gas Distribution -- Abstract -- 1 Introduction -- 2 Literature Review -- 3 Problem Description -- 3.1 Multi-products Network -- 3.2 Plant Locations and Filling Tools -- 3.3 Cylinder Flows -- 3.4 Primary Transport Cost -- 3.5 Secondary Transport Cost -- 3.6 Trucks -- 3.7 Inventory Management -- 4 Mathematical Model -- 5 Solution Approach. 5.1 Mono-Product Approximation -- 5.2 Two-Steps Decomposition -- 6 Numerical Results -- 7 Conclusions -- References -- Elaboration of General Lower Bounds for the Total Completion Time in Flowshop Scheduling Problems through MaxPlus Approach -- 1 Introduction -- 2 Context and Definitions -- 2.1 MaxPlus Algebra -- 2.2 Flowshop Scheduling Problem -- 3 MaxPlus Modeling of Flowshop Scheduling Problems -- 4 Proposed Lower Bounds -- 4.1 The First Lower Bound -- 4.2 Additional Similar Lower Bounds -- 5 Branch-and-Bound Algorithm -- 5.1 Proposed Branch-and-Bound Procedure -- 5.2 Lower Bound Selection Strategy -- 6 Experimental Results -- 7 Conclusions -- References -- Author Index. |
| Record Nr. | UNINA-9910299235003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||