1  20
Next
Number of results to display per page
1. Multiobjective combinatorial optimization problems and solution methods [electronic resource] [2022]
 London : Academic Press, 2022.
 Description
 Book — 1 online resource
 Summary

 1. Multiobjective combinatorial optimization problems: Social, Keywords, and Journal maps Mehdi Toloo, Siamak Talatahari, Iman Rahimi and Amir H. Gandomi
 2. The Fundamentals and Potential of Heuristics and Metaheuristics for MultiObjective Combinatorial Optimization Problems and Solution Methods Ana Carolina Borges Monteiro, Reinaldo Padilha Franca, Rangel Arthur, Yuzo Iano and Reinaldo Padilha Franca
 3. A survey on links between multiple objective decision making and data envelopment analysis Amineh Ghazi and Farhad Hosseinzadeh Lotfi II. New methods for combinatorial optimization problems
 4. Improved Crow Search Algorithm Based on Arithmetic Cross Over A Novel Metaheuristic Technique for Solving Engineering Optimization Problems S N Kumar, A Lenin Fred, R. Jonisha Miriam, Padmanabhan Parasuraman, Balazs Gulyas, Ajay Kumar Haridhas and Nisha Dayana
 5. MOGROM: Multiobjective Golden Ratio Optimization Algorithm Behrooz Vahidi, Amin Foroughi and Abolfazl Rahiminejad III. Application of randombased methods for combinatorial optimization problems
 6. MultiObjective Charged System Search for Optimum Location of Bank Branch Siamak Talatahari
 7. Application of Multiobjective Grey Wolf Optimization in Gasificationbased Problems Siamak Talatahari
 8. A VDSNSGAII Algorithm for MultiYear MultiObjective Dynamic Generation and Transmission Expansion Planning Ali Esmaeel Nezhad
 9. A MultiObjective Cuckoo Search Algorithm for Community Detection in Social Networks Farhad Soleimanian Gharehchopogh and Shafih Ghafori IV. Application of other methods for combinatorial optimization problems
 10. Finding efficient solutions of the multicriteria assignment problem Emmanuel Kwasi Mensah, Esmaeil Keshavarz and Mehdi Toloo
 11. Application of Multiobjective Optimization in Thermal Design and Analysis of Complex Energy Systems Ali Baghernejad and Elnaz Aslanzadeh
 12. A MultiObjective Nonlinear Combinatorial Model for Improved Planning of Tour Visits Using a Novel Binary GainingSharing knowledgebased Optimization Algorithm Ali Wagdy wagdy, Said Hassan, Prachi Agrawal and Talari Ganesh
 13. Variables Clustering Method to Enable Planning of Large Supply Chains Emilio Bertolotti Sr.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
2. Nonlinear combinatorial optimization [2019]
 Cham, Switzerland : Springer, [2019]
 Description
 Book — 1 online resource
 Summary

 A role of minimum spanning tree. Discrete Newton method. An overview of submodular optimization: single and multiobjectives. Discrete convex optimization and applications in supply chain management. Thresholding methods for streaming submodular maximization with a cardinality constraint and its variants. Nonsubmodular optimization. On blockstructured integer programming and its applications. Online combinatorial optimization problems with nonlinear objectives. Solving combinatorial problems with machine learning methods. Modeling malware propagation dynamics and developing prevention method in wireless sensor networks. Composed influence in social networks. Friending. Optimization on content spread in social network studies. Interationaware influence maximization in social networks. Multidocument extractive summarization as a nonlinear combinatorial optimization Viral marketing for complementary products.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Bärmann, Andreas, author.
 Wiesbaden : Springer Spektrum, 2016.
 Description
 Book — 1 online resource (xv, 203 pages) : illustrations (some color)
 Summary

 Decomposition for MultiPeriod Network Design
 Solving Network Design Problems via Aggregation
 Approximate SecondOrder Cone Robust Optimization.
 New York : Springer, ©2005.
 Description
 Book — 1 online resource (vi, 394 pages) : illustrations Digital: text file.PDF.
 Summary

 Preface  Data Correcting Algorithms in Combinatorial Optimization  The Steiner Ratio of BanachMinkowski Space  Probabilistic Verification and NonApproximability  Steiner Trees in Industry  NetworkBased Model and Algorithms in Data Mining and Knowledge Discovery  The Generalized Assignment Problem and Extensions  Optimal Rectangular Partitions  Connected Dominating Sets in Sensor Networks and MANETs  Author Index  Subject Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
5. Differential evolution : a handbook for global permutationbased combinatorial optimization [2009]
 Berlin : SpringerVerlag, ©2009.
 Description
 Book — 1 online resource
 Summary

 Motivation for Differential Evolution for PermutativeBased Combinatorial Problems. Differential Evolution for PermutationBased Combinatorial Problems. Forward Backward Transformation. Relative Position Indexing Approach. Smallest Position Value Approach. Discrete/Binary Approach. Discrete Set Handling.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Korte, B. H. (Bernhard H.), 1938
 3rd ed.  Berlin ; New York : Springer, c2006.
 Description
 Book — xv, 597 p. : ill. ; 24 cm.
 Summary

 Preface. Introduction. Graphs. Linear Programming. Linear Programming Algorithms. Integer Programming. Spanning Trees and Arborescences. Shortest Paths. Network Flows. Minimum Cost Flows. Maximum Matchings. Weighted Matching. bMatchings and TJoins. Matroids. Generalizations of Matroids. NPCompleteness. Approximation Algorithms. The Knapsack Problem. Bin Packing. Multicommodity Flows and EdgeDisjoint Paths. Network Design Problems. The Traveling Salesman Problem. Facility Location. Notation Index. Author Index. Subject Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
SAL3 (offcampus storage)
SAL3 (offcampus storage)  Status 

Stacks  Request (opens in new tab) 
QA402.5 .K6665 2006  Available 
 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)
 Martí, Rafael (Rafael Cunquero), author.
 Second edition.  Berlin, Germany : Springer, 2022.
 Description
 Book — 1 online resource (xi, 227 pages) : illustrations (some color).
 Summary

 1 Introduction. 2 Heuristic Methods. 3 MetaHeuristics. 4 BranchandBound. 5 BranchandCut. 6 The Linear Ordering Polytope. 7 Further Aspects. References. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Mankowski, Michal, author.
 Cham : Springer, [2021]
 Description
 Book — 1 online resource (213 pages) Digital: text file.PDF.
 Summary

 Introduction. Circuits Without Repetitions. Main Tools. Combinatorial Optimization Problems. Conventional Circuits. MultiStage and BiCriteria Optimization of Matchings in Trees. Combinatorial Optimization Problems. Syntactical Circuits. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Ouaarab, Aziz, author.
 Singapore : Springer, [2020]
 Description
 Book — 1 online resource
 Summary

 Combinatorial optimization space. Solving COPs. From CS to DCS. DCS and the studied COPs. Cuckoo search Random key encoding.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Hartmann, Alexander K.
 Weinheim : WileyVCH, 2005.
 Description
 Book — xi, 348 p. : ill. ; 25 cm.
 Summary

 Preface.
 1 Introduction. 1.1 Two examples of combinatorial optimization. 1.2 Why study combinatorial optimization using statistical physics? 1.3 Textbooks. Bibliography.
 2 Algorithms. 2.1 Pidgin Algol. 2.2 Iteration and recursion. 2.3 Divide and conquer. 2.4 Dynamic programming. 2.5 Backtracking. Bibliography.
 3 Introduction to graphs. 3.1 Basic concepts and graph problems. 3.2 Basic graph algorithms. 3.3 Random graphs. Bibliography.
 4 Introduction to complexity theory. 4.1 Turing machines. 4.2 Church's thesis. 4.3 Languages. 4.4 The halting problem. 4.5 Class P. 4.6 Class NP. 4.7 Definition of NP completeness. 4.8 NP complete problems. 4.9 Worst case vs. typical case complexity. Bibliography.
 5 Statistical mechanics of the Ising model. 5.1 Phase transitions. 5.2 Some general notes on statistical mechanics. 5.3 The Curie Weiss model of a ferromagnet. 5.4 The Ising model on a random graph. Bibliography.
 6 Algorithms and numerical results for vertex covers. 6.1 Definitions. 6.2 Heuristic algorithms. 6.3 Branch and bound algorithm. 6.4 Results: Covering random graphs. 6.5 The leaf removal algorithm. 6.6 Monte Carlo simulations. 6.7 Backbone. 6.8 Clustering of minimum vertex covers. Bibliography.
 7 Statistical mechanics of vertex covers on a random graph. 7.1 Introduction. 7.2 The first moment bound. 7.3 The hard core lattice gas. 7.4 Replica approach. Bibliography.
 8 The dynamics of vertex cover algorithms. 8.1 The typical case solution time of a complete algorithm. 8.2 The dynamics of generalized leaf removal algorithms. 8.3 Random restart algorithms. Bibliography.
 9 Towards new, statistical mechanics motivated algorithms. 9.1 The cavity graph. 9.2 Warning propagation. 9.3 Belief propagation. 9.4 Survey propagation. 9.5 Numerical experiments on random graphs. Bibliography.
 10 The satisfiability problem. 10.1 SAT algorithms. 10.2 Phase transitions in random K SAT. 10.3 Typical case dynamics of RandomWalkSAT. 10.4 Message passing algorithms for SAT. Bibliography.
 11 Optimization problems in physics. 11.1 Monte Carlo optimization. 11.2 Hysteric optimization. 11.3 Genetic algorithms. 11.4 Shortest paths and polymers in random media. 11.5 Maximum flows and random field systems. 11.6 Submodular functions and free energy of Potts model. 11.7 Matchings and spin glasses. Bibliography. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
12. Journal of combinatorial optimization [1997 ]
 Journal of combinatorial optimization (Online)
 19972004 ; Boston : Kluwer Academic Publishers 2005 ; [New York] : Springer US
 Description
 Journal/Periodical
 Berlin ; Heidelberg : SpringerVerlag, ©2010.
 Description
 Book — 1 online resource (xii, 195 pages) Digital: text file; PDF.
 Summary

 MultiObjective Combinatorial Optimization: Problematic and Context. Approximating ParetoOptimal Sets Using Diversity Strategies in EvolutionaryMultiObjective Optimization. On the Velocity Update in Multiobjective Particle Swarm Optimizers. Approaching Dynamic Multiobjective Optimization Problems by Using Parallel Evolutionary Algorithms. ParadisEOMOEO: A Software Framework for Evolutionary Multiobjective Optimization. The Multiobjective Traveling Salesman Problem: A Survey and a New Approach. On the Performance of Local Search for the Biobjective Traveling Salesman Problem. A BiobjectiveMetaheuristic for Disaster Relief Operation Planning.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
 Berlin ; Heidelberg : SpringerVerlag, ©2009.
 Description
 Book — 1 online resource
 Summary

 Global Optimization in Supply Chain Operations. Solving RealWorld Vehicle Routing Problems with Evolutionary Algorithms. A Genetic Algorithm with Priority Rules for Solving JobShop Scheduling Problems. An Estimation of Distribution Algorithm for Flowshop Scheduling with Limited Buffers. Solving Hierarchically Decomposable Problems with the Evolutionary Transition Algorithm. Electrical Load Forecasting using a NeuralFuzzy Approach. Quantised Problem Spaces and the Particle Swarm Algorithm. A Coevolutionary Particle Swarm Algorithm for BiLevel Variational Inequalities: Applications to Competition in Highway Transportation Networks. Ant Colony Optimization and Its Application to the Vehicle Routing Problem with Pickups and Deliveries. Evolutionary and Ant Colony Optimization Based Approaches for Twodimensional Strip Packing Problem. Diagnosis, Configuration, Planning, and Pathfinding: Experiments in NatureInspired Optimization. A Hybrid Intelligent System for Distributed Dynamic Scheduling.
 (source: Nielsen Book Data)
 Birattari, Mauro.
 Berlin : Springer, ©2009.
 Description
 Book — 1 online resource (x, 221 pages) : illustrations Digital: text file.PDF.
 Summary

 Background and StateoftheArt. Statement of the Tuning Problem. FRace for Tuning Metaheuristics. Experiments and Applications. Some Considerations on the Experimental Methodology. Conclusions.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
16. Adaptive and multilevel metaheuristics [2008]
 Berlin : Springer, ©2008.
 Description
 Book — 1 online resource (xv, 273 pages) : illustrations Digital: text file.PDF.
 Summary

 Part I Reviews of the Field. Hyperheuristics: Recent Developments. SelfAdaptation in Evolutionary Algorithms for Combinatorial Optimisation. Part II New Techniques and Applications. An Efficient Hyperheuristic for StripPacking Problems. Probabilitydriven simulated annealing for optimizing digital FIR filters. RASH: A Selfadaptive Random Search Method. Market Based Allocation of Transportation Orders to Vehicles in Adaptive MultiObjective Vehicle Routing. A Simple Evolutionary Algorithm with SelfAdaptation for MultiObjective Nurse Scheduling. Individual Evolution as an Adaptive Strategy for Photogrammetric Network Design. Adaptive Estimation of Distribution Algorithms. Initialization and Displacement of the Particles in TRIBES, a ParameterFree Particle Swarm Optimization Algorithm. Evolution of Descent Directions. "Multiple Neighbourhood" Search in Commercial VRP Packages: Evolving Towards SelfAdaptive Methods. Automated Parameterisation of a Metaheuristic for the Orienteering Problem.
 (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)
 Foulds, L. R.
 New York, NY : Springer US, 1984.
 Description
 Book — 1 online resource (volumes) Digital: text file.PDF.
 Summary

 One: Techniques. 0 Introduction to the Techniques of Combinatorial Optimization. 0
 .1. The General Problem. 0
 .2. Important Combinatorial Optimization Problems. 0
 .3. The Fundamental Algorithm, Efficiency and the Digital Computer. 1 Linear Programming and Extensions. 1
 .1. An Introduction to Linear Programming. 1
 .2. The Transportation Problem. 1
 .3. The Assignment Problem. 2 Solution Techniques. 2
 .1. Integer Programming. 2
 .2. Dynamic Programming. 2
 .3. Complexity. 2
 .4. Heuristic Problem Solving. 3 Optimization on Graphs and Networks. 3
 .1. Minimal Spanning Trees. 3
 .2. Shortest Paths. 3
 .3. The MaximumFlow Problem. 3
 .4. The MinimumCostFlow Problem. 3
 .5. Activity Networks. Two: Applications. 4 Some Applications of Combinatorial Optimization Techniques. 4
 .1. Facilities Layout. 4
 .2. The Traveling Salesman Problem. 4
 .3. The Vehicle Scheduling Problem. 4
 .4. Car Pooling. 4
 .5. Evolutionary Tree Construction. 5 Appendix. 5
 .1. Linear Algebra. 5
 .2. Graph Theory. Further Reading.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
19. Submodular functions and optimization [2005]
 Fujishige, Satoru.
 2nd ed.  Amsterdam ; Boston ; Oxford : Elsevier, 2005.
 Description
 Book — 1 online resource (xiv, 395 pages) : illustrations
 Summary

 Preface. Preface to the Second Editor. Part I.
 Chapter I. Introduction.
 Chapter II. Submodular Systems and Base Polyhedra.
 Chapter III. Neoflows.
 Chapter IV. Submodular Analysis.
 Chapter V. Nonlinear Optimizaation with Submodular Constraints. Part II.
 Chapter VI. Submodular Function Minimization.
 Chapter VII. Discrete Convex Analysis. References. Index.
 (source: Nielsen Book Data)
(source: Nielsen Book Data)
20. Graphs and combinatorial optimization : from theory to applications : CTW2020 Proceedings [2021]
 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)
Articles+
Journal articles, ebooks, & other eresources
Guides
Course and topicbased guides to collections, tools, and services.