图书简介

1 C. Cervellera et al., A receding horizon approach for berth allocation based on random search optimization.- 2 G. Di Tollo et al., Integrating ship movement scheduling and tug assignment within a canal harbor.- 3 G. Auricchio et al., The Maximum Nearby Flow Problem.- 4 T. Alves de Queiroz et al., Linear models for portfolio selection with real features.- 5 M. Maggi and P. Uberti, Portfolio Leverage in Asset Allocation Problems.- 6 V. Cacchiani et al., Energy-Efficient Train Control.- 7 C. Cervellera and D. Maccio, Gradient boosting with extreme learning machines for the optimization of nonlinear functionals.- 8 M. Benini et al., A MILP model for biological sample transportation in healthcare.- 9 E. Marcelli and R. De Leone, Infinite Kernel Extreme Learning Machine.- 10 A. Betti and M. Gori, Least Action Principles and Well-Posed Learning Problems.- 11 M. Casazza and A. Ceselli, Heuristic data-driven feasibility on Integrated Planning and Scheduling.- 12 M. Barbato et al., Evaluating automated storage and retrieval system policies with simulation and optimization.- 13 E. Tresoldi and A. Ceselli, Rolling-horizon heuristics for capacitated stochastic inventory problems with forecast updates.- 14 M. Barbato et al., Paths and matchings in an automated warehouse.- 15 H. Aldossary and G. Coates, Coordinating the Emergency Response of Ambulances to Multiple Mass Casualty Incidents using an Optimization-based Approach.- 16 L. Scrimali and G. Fargetta, A game theory model of online content competition.- 17 G. Cappello and P. Daniele, A Variational Formulation for a Human Migration Problem.- 18 M. Cerulli et al., Flying safely by bilevel programming.- 19 S. Basso and A. Ceselli, Computational evaluation of data driven local search for MIP decompositions.- 20 G. Colajanni, An integer programming formulation for University Course Timetabling.- 21 P. Hosein et al., On the Sizing of Security Personnel Staff while accounting for Overtime Pay.- 22 M.-S. Vie and N. Zufferey, Dynamic Tabu Search for Enhancing the Productivity of a Bottle Production Line.- 23 M. Boccia et al., Swap minimization in nearest neighbour quantum circuits: an ILP formulation.- 24 M. Passacantando and F. Raciti, A traffic equilibrium nonlinear programming model for optimizing road maintenance investments.- 25 L. Mastroeni et al., Opinion dynamics in multi-agent systems under proportional updating and any-to-any influence.- 26 M. F. Monaco and M. Sammarra, A new formulation of the single door truck scheduling problem.- 27 L. Rarita, Optimization of car traffic in emergency conditions.- 28 M. E. Bruni at al., The Cumulative Capacitated Vehicle Routing Problem with Profits under Uncertainty.- 29 P. Beraldi et al., Dealing with the stochastic home energy management problem.- 30 J.-F. Cote et al., Optimization Methods for the Same-Day Delivery Problem.- 31 D. Ambrosino and V. Asta, Intermodality and rail transport: focus on port rail shunting operations.- 32 D. Ferone et al., The k-Color Shortest Path Problem.- 33 M. E. Bruni et al., The Traveling Repairman Problem App for Mobile Phones: a Case on Perishable Product Delivery.- 34 R. Tison and N. Zufferey, Integrating Vehicle Routing and Resource Allocation in a Pharmaceutical Network.- 35 E. Parra, A real case on making strategic logistics decisions with production and inventory optimization models.- 36 A. Alves da Silva Mundim et al., A Bi-objective Mixed Integer Model for the Single Link Inventory Routing Problem Using the e-constraint Method.- 37 M. Pour-Massahian-Tafti et al., Models for Disassembly Lot Sizing Problem with Decisions on Surplus Inventory.- 38 R. Berruto et al., Learning inventory control rules for perishable items by simulation-based optimization.- 39 C. Cerrone et al., A Genetic Algorithm for Minimum Conflict Weighted Spanning Tree Problem.- 40 G. Lancia and M. Dalpasso, Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood.- 41 M. Barbato et al., A computational evaluation of online ATSP algorithms.- 42 F. Wamser et al., Modeling of Traffic Flows in Internet of Things Using Renewal Approximation.- 43 F. Davoli et al., Flow Assignment in Multi-Core Network Processors.

Trade Policy 买家须知