Federico Malucelli

Comput. Oper. Res., July, 2023

Scheduling a pick and place packaging line.

[BibT_eX]

[DOI]

Tommaso Schettini

Helena Ramalhinho

J. Sched., 2023

Dynamic Routing for the Electric Vehicle Shortest Path Problem with Charging Station Occupancy Information.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Demand-Driven Timetabling for a Metro Corridor Using a Short-Turning Acceleration Strategy.

[BibT_eX]

[DOI]

Tommaso Schettini

Ola Jabali

Transp. Sci., 2022

A Benders decomposition algorithm for demand-driven metro scheduling.

[BibT_eX]

[DOI]

Tommaso Schettini

Ola Jabali

Comput. Oper. Res., 2022

The Long-Haul Transportation Problem with Refueling Deviations and Time-Dependent Travel Time.

[BibT_eX]

[DOI]

Proceedings of the Computational Logistics - 13th International Conference, 2022

The electric vehicle shortest path problem with time windows and prize collection.

[BibT_eX]

[DOI]

Proceedings of the 17th Conference on Computer Science and Intelligence Systems, 2022

2021

The Single-Line Design Problem for Demand-Adaptive Transit Systems: A Modeling Framework and Decomposition Approach for the Stationary-Demand Case.

[BibT_eX]

[DOI]

Fausto Errico

Transp. Sci., 2021

Empowering Optimization Skills Through an Orienteering Competition.

[BibT_eX]

[DOI]

INFORMS Trans. Educ., 2021

A personalized walking bus service requiring optimized route decisions: A real case.

[BibT_eX]

[DOI]

Emanuele Tresoldi

Eur. J. Oper. Res., 2021

2020

Making high school students aware of optimization through games and puzzles.

[BibT_eX]

[DOI]

Marianna Fornasiero

RAIRO Oper. Res., 2020

2019

Delay and disruption management in local public transportation via real-time vehicle and crew re-scheduling: a case study.

[BibT_eX]

[DOI]

Emanuele Tresoldi

Public Transp., 2019

2018

A Special Vehicle Routing Problem Arising in the Optimization of Waste Disposal: A Real Case.

[BibT_eX]

[DOI]

Transp. Sci., 2018

The quadratic shortest path problem: complexity, approximability, and solution methods.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Designing Pedibus Lines: a Path Based Approach.

[BibT_eX]

[DOI]

Emanuele Tresoldi

Electron. Notes Discret. Math., 2018

2017

A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems.

[BibT_eX]

[DOI]

Fausto Errico

Transp. Sci., 2017

2016

Lower bounding procedure for the asymmetric quadratic traveling salesman problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

A generalized Gilmore-Lawler procedure for the Quadratic Assignment Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2015

Lower bounds for the Quadratic Minimum Spanning Tree Problem based on reduced cost computation.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2015

An application of constraint solving for home health care.

[BibT_eX]

[DOI]

AI Commun., 2015

On the Quadratic Shortest Path Problem.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

2014

A revised reformulation-linearization technique for the quadratic assignment problem.

[BibT_eX]

[DOI]

Discret. Optim., 2014

Content-aware planning models for information-centric networking.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2014

2013

A Graph Optimization Approach to Item-Based Collaborative Filtering.

[BibT_eX]

[DOI]

Paolo Cremonesi

Proceedings of the Recent Advances in Computational Optimization, 2013

In memoriam of Francesco Maffioli (1941-2012).

[BibT_eX]

[DOI]

Int. Trans. Oper. Res., 2013

Quadratic TSP: A lower bounding procedure and a column generation approach.

[BibT_eX]

[DOI]

Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012

Hyperbolic set covering problems with competing ground-set elements.

[BibT_eX]

[DOI]

Sandro Bosio

Math. Program., 2012

Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2012

A simple branching scheme for vertex coloring problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Designing the master schedule for demand-adaptive transit systems.

[BibT_eX]

[DOI]

Fausto Errico

Ann. Oper. Res., 2012

Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit.

[BibT_eX]

[DOI]

Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

An Application of Bicriterion Shortest Paths to Collaborative Filtering.

[BibT_eX]

[DOI]

Paolo Cremonesi

Proceedings of the Federated Conference on Computer Science and Information Systems, 2012

Resource Constrained Shortest Paths with a Super Additive Objective Function.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

2011

Solving Nonlinear Covering Problems Arising in WLAN Design.

[BibT_eX]

[DOI]

Oper. Res., 2011

SRG-Disjoint Design with Dedicated and Shared Protection.

[BibT_eX]

[DOI]

Bernardetta Addis

Giuliana Carello

Proceedings of the Network Optimization - 5th International Conference, 2011

Network design with SRG based protection.

[BibT_eX]

[DOI]

Bernardetta Addis

Giuliana Carello

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010

Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation.

[BibT_eX]

[DOI]

Networks, 2010

Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2010

On the Design of the Next Generation Access Networks.

[BibT_eX]

[DOI]

Domenico L. Sozzi

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

On the Design of the Fiber To The Home Networks.

[BibT_eX]

Domenico L. Sozzi

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

2009

Constraint programming-based column generation.

[BibT_eX]

[DOI]

4OR, 2009

2008

Radio planning and coverage optimization of 3G cellular networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2008

The stack loading and unloading problem.

[BibT_eX]

[DOI]

Stefano Pallottino

Daniele Pretolani

Discret. Appl. Math., 2008

Multi-layer MPLS network design: The impact of statistical multiplexing.

[BibT_eX]

[DOI]

Comput. Networks, 2008

Optimization models and methods for planning wireless mesh networks.

[BibT_eX]

[DOI]

Comput. Networks, 2008

Exact Graph Coloring via Hybrid Approaches.

[BibT_eX]

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

Multicommodity network design with discrete node costs.

[BibT_eX]

[DOI]

Pietro Belotti

Lorenzo Brunetta

Networks, 2007

Shiftable intervals.

[BibT_eX]

[DOI]

Sara Nicoloso

Ann. Oper. Res., 2007

Optimization Models for the Radio Planning of Wireless Mesh Networks.

[BibT_eX]

[DOI]

Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007

Direct optimal design of a quasi-regular composite-star core network.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Design and Reliable Communication Networks, 2007

2006

Optimizing base station location and configuration in UMTS networks.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2006

Optimization Problems and Models for Planning Cellular Networks.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005

Meta-Heuristics for a Class of Demand-Responsive Transit Systems.

[BibT_eX]

[DOI]

François Guertin

INFORMS J. Comput., 2005

Optimal Partition of a Bipartite Graph with Prescribed Layout into Non-Crossing b-Matchings.

[BibT_eX]

[DOI]

Sara Nicoloso

Electron. Notes Discret. Math., 2005

2004

Joint Optical Network Design, Routing and Wavelength Assignment by Integer Programming.

[BibT_eX]

[DOI]

Telecommun. Syst., 2004

Network design with grooming constraints.

[BibT_eX]

[DOI]

Pietro Belotti

Electron. Notes Discret. Math., 2004

An asymmetric vehicle routing problem arising in the collection and disposal of special waste.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Optimization of packet scheduling in wireless systems with smart antennas: geometric models and algorithms.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2004

Optimizing WLAN radio coverage.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2004

Algorithms for WLAN Coverage Planning.

[BibT_eX]

[DOI]

Proceedings of the Wireless Systems and Mobility in Next Generation Internet, 2004

2003

Planning UMTS base station location: optimization models with power control and algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2003

Discrete models and algorithms for packet scheduling in smart antennas.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

The Base-matroid and Inverse Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Mauro Dell'Amico

Francesco Maffioli

Discret. Appl. Math., 2003

Optimal Operations Management and Network Planning of a District Heating System with a Combined Heat and Power Plant.

[BibT_eX]

[DOI]

Roberto Aringhieri

Ann. Oper. Res., 2003

Chemical trees enumeration algorithms.

[BibT_eX]

[DOI]

Roberto Aringhieri

Pierre Hansen

4OR, 2003

Optimization models and algorithms for downlink UMTS radio planning.

[BibT_eX]

[DOI]

Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

Radio Planning and Optimization of W-CDMA Systems.

[BibT_eX]

[DOI]

Proceedings of the Personal Wireless Communications, IFIP-TC6 8th International Conference, 2003

2002

On bandwidth-2 graphs.

[BibT_eX]

[DOI]

Alberto Caprara

Daniele Pretolani

Discret. Appl. Math., 2002

Optimizing UMTS radio coverage via base station configuration.

[BibT_eX]

[DOI]

Proceedings of the 13th IEEE International Symposium on Personal, 2002

2001

A Modeling Framework for Passenger Assignment on a Transport Network with Timetables.

[BibT_eX]

[DOI]

Sang Nguyen

Stefano Pallottino

Transp. Sci., 2001

A Linear Algorithm for the Hyper-Wiener Index of Chemical Trees.

[BibT_eX]

[DOI]

Roberto Aringhieri

Pierre Hansen

J. Chem. Inf. Comput. Sci., 2001

Optimal partition of a bipartite graph into non-crossing matchings.

[BibT_eX]

[DOI]

Sara Nicoloso

Electron. Notes Discret. Math., 2001

Improved models and algorithms for UMTS radio planning.

[BibT_eX]

[DOI]

Proceedings of the 54th IEEE Vehicular Technology Conference, 2001

Discrete models and algorithms for the capacitated location problems arising in UMTS network planning.

[BibT_eX]

[DOI]

Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

1999

Testing optimality for quadratic 0-1 problems.

[BibT_eX]

[DOI]

Fernanda Farinaccio

Math. Program., 1999

On a 2-dimensional equipartition problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

1998

A new matrix bandwidth reduction algorithm.

[BibT_eX]

[DOI]

Alessandra Esposito

M. S. Fiorenzo Catalano

Luciano Tarricone

Oper. Res. Lett., 1998

1995

Testing optimality for quadratic 0-1 unconstrained problems.

[BibT_eX]

[DOI]

Massimo Pappalardo

Math. Methods Oper. Res., 1995

1993

Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem.

[BibT_eX]

[DOI]

Thomas Ottmann

Daniele Pretolani

Discret. Appl. Math., 1993

A Reformulation Scheme and New Lower Bounds for the QAP.

[BibT_eX]

[DOI]

Proceedings of the Quadratic Assignment and Related Problems, 1993

1992

A New Lower Bound for the Quadratic Assignment Problem.

[BibT_eX]

[DOI]