Anand Subramanian

According to our database, Anand Subramanian authored at least 70 papers between 2008 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Population-based iterated local search for batch scheduling on parallel machines with incompatible job families, release dates, and tardiness penalties.

José Maurício Fernandes Medeiros, Anand Subramanian, Eduardo Queiroga

Optim. Lett., January, 2025

2024

A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery.

Rafael Praxedes, Teobaldo Bulhões, Anand Subramanian, Eduardo Uchoa

Comput. Oper. Res., February, 2024

Computing the worst-case due dates violations with budget uncertainty.

Igor Malheiros, Artur Alves Pessoa, Michael Poss, Anand Subramanian

Oper. Res. Lett., 2024

The maximum length car sequencing problem.

Lara Pontes, Carlos Neves, Anand Subramanian, Maria Battarra

Eur. J. Oper. Res., 2024

Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates.

Rafael Morais, Teobaldo Bulhões, Anand Subramanian

Eur. J. Oper. Res., 2024

An Integrated Decision Support System for Intra-Logistics Management with Peripheral Storage and Centralized Distribution.

Giulia Dotti, Manuel Iori, Anand Subramanian, Marco Taccini

Proceedings of the 26th International Conference on Enterprise Information Systems, 2024

2023

Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows.

Yure Rocha, Anand Subramanian

Comput. Oper. Res., July, 2023

Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem.

Toni Pacheco, Rafael Martinelli, Anand Subramanian, Túlio A. M. Toffolo, Thibaut Vidal

Transp. Sci., March, 2023

Improving Buffer Storage Performance in Ceramic Tile Industry Via Simulation.

Marco Taccini, Manuel Iori, Giulia Dotti, Anand Subramanian

Proceedings of the Winter Simulation Conference, 2023

2022

Minimizing energy consumption in a real-life classroom assignment problem.

Raphael Medeiros Alves, Francisco Cunha, Anand Subramanian, Alisson V. Brito

OR Spectr., 2022

Scheduling the Brazilian OR conference.

Rubens Correia, Anand Subramanian, Teobaldo Bulhões, Puca Huachi Vaz Penna

J. Oper. Res. Soc., 2022

Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling.

Artur Alves Pessoa, Teobaldo Bulhões, Vitor Nesello, Anand Subramanian

INFORMS J. Comput., 2022

Intersections management for autonomous vehicles: a heuristic approach.

Victor Silva, Clauirton A. Siebra, Anand Subramanian

J. Heuristics, 2022

Conference scheduling: A clustering-based approach.

Teobaldo Bulhões, Rubens Correia, Anand Subramanian

Eur. J. Oper. Res., 2022

2021

Personnel scheduling during Covid-19 pandemic.

Giorgio Zucchi, Manuel Iori, Anand Subramanian

Optim. Lett., 2021

Exact and metaheuristic approaches for identical parallel machine scheduling with a common server and sequence-dependent setup times.

João Marcos P. Silva, Ewerton Teixeira, Anand Subramanian

J. Oper. Res. Soc., 2021

Integer programming formulations and efficient local search for relaxed correlation clustering.

Eduardo Queiroga, Anand Subramanian, Rosa Figueiredo, Yuri Frota

J. Glob. Optim., 2021

Iterated local search for single machine total weighted tardiness batch scheduling.

Eduardo Queiroga, Rian G. S. Pinheiro, Quentin Christ, Anand Subramanian, Artur Alves Pessoa

J. Heuristics, 2021

A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints.

Guilherme Henrique Ismael de Azevedo, Artur Alves Pessoa, Anand Subramanian

Eur. J. Oper. Res., 2021

Share-a-ride problems: Models and Solution Algorithms.

Ana Beatriz Herthel, Richard F. Hartl, Thibaut Vidal, Anand Subramanian

CoRR, 2021

A simple and effective hybrid genetic search for the job sequencing and tool switching problem.

Jordana Mecler, Anand Subramanian, Thibaut Vidal

Comput. Oper. Res., 2021

A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem.

Igor Malheiros, Rodrigo Ramalho, Bruno Passeti, Teobaldo Bulhões, Anand Subramanian

Comput. Oper. Res., 2021

An Integrated Task and Personnel Scheduling Problem to Optimize Distributed Services in Hospitals.

Nícolas P. Campana, Giorgio Zucchi, Manuel Iori, Carlo Alberto Magni, Anand Subramanian

Proceedings of the 23rd International Conference on Enterprise Information Systems, 2021

2020

On the exact solution of a large class of parallel machine scheduling problems.

Teobaldo Bulhões, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa

J. Sched., 2020

Solution strategies for the vehicle routing problem with backhauls.

Anand Subramanian, Eduardo Queiroga

Optim. Lett., 2020

On the exact solution of vehicle routing problems with backhauls.

Eduardo Queiroga, Yuri Frota, Ruslan Sadykov, Anand Subramanian, Eduardo Uchoa, Thibaut Vidal

Eur. J. Oper. Res., 2020

Optimizing single-finger keyboard layouts on smartphones.

Ana Beatriz Herthel, Anand Subramanian

Comput. Oper. Res., 2020

On solving the capacitated routing and spectrum allocation problem for flexgrid optical networks.

Carlos M. Araújo, João Marcos P. Silva, Anand Subramanian, Iguatemi E. Fonseca

Comput. Networks, 2020

2019

The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations.

Bruno Petrato Bruck, Fábio Cruz, Manuel Iori, Anand Subramanian

Transp. Sci., 2019

A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems.

Arthur Kramer, Anand Subramanian

J. Sched., 2019

A multi-objective evolutionary algorithm for a class of mean-variance portfolio selection problems.

Yuri Laio T. V. Silva, Ana Beatriz Herthel, Anand Subramanian

Expert Syst. Appl., 2019

A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet.

Puca Huachi Vaz Penna, Anand Subramanian, Luiz Satoru Ochi, Thibaut Vidal, Christian Prins

Ann. Oper. Res., 2019

2018

A hybrid iterated local search heuristic for the maximum weight independent set problem.

Bruno C. S. Nogueira, Rian G. S. Pinheiro, Anand Subramanian

Optim. Lett., 2018

A two-phase Pareto local search heuristic for the bi-objective pollution-routing problem.

Luciano Costa, Thibaut Lust, Raphael Kramer, Anand Subramanian

Networks, 2018

Mathematical models and decomposition algorithms for makespan minimization in plastic rolls production.

Vitor Nesello, Maxence Delorme, Manuel Iori, Anand Subramanian

J. Oper. Res. Soc., 2018

Generating guitar solos by integer programming.

Nailson dos Santos Cunha, Anand Subramanian, Dorien Herremans

J. Oper. Res. Soc., 2018

Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times.

Vitor Nesello, Anand Subramanian, Maria Battarra, Gilbert Laporte

Eur. J. Oper. Res., 2018

The static bike relocation problem with multiple vehicles and visits.

Teobaldo L. Bulhões Júnior, Anand Subramanian, Günes Erdogan, Gilbert Laporte

Eur. J. Oper. Res., 2018

Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times.

Yuri Laio T. V. Silva, Anand Subramanian, Artur Alves Pessoa

Comput. Oper. Res., 2018

Continuous greedy randomized adaptive search procedure for data clustering.

Eduardo Queiroga, Anand Subramanian, Lucídio dos Anjos F. Cabral

Appl. Soft Comput., 2018

2017

New benchmark instances for the Capacitated Vehicle Routing Problem.

Eduardo Uchoa, Diego Pecin, Artur Alves Pessoa, Marcus Poggi, Thibaut Vidal, Anand Subramanian

Eur. J. Oper. Res., 2017

Branch-and-cut approaches for p-Cluster Editing.

Teobaldo L. Bulhões Júnior, Gilberto Farias de Sousa Filho, Anand Subramanian, Lucídio dos Anjos F. Cabral

Discret. Appl. Math., 2017

Corrigendum to "Hybrid metaheuristics for the clustered vehicle routing problem [Comput. Oper. Res., 58 (2015): 87-99]".

Thibaut Vidal, Maria Battarra, Anand Subramanian, Günes Erdogan

Comput. Oper. Res., 2017

Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times.

Anand Subramanian, Katyanne Farias

Comput. Oper. Res., 2017

A heuristic algorithm for a single vehicle static bike sharing rebalancing problem.

Fábio Cruz, Anand Subramanian, Bruno Petrato Bruck, Manuel Iori

Comput. Oper. Res., 2017

Branch-and-price for <i>p</i>-cluster editing.

Teobaldo L. Bulhões Júnior, Anand Subramanian, Gilberto Farias de Sousa Filho, Lucídio dos Anjos F. Cabral

Comput. Optim. Appl., 2017

2016

Efficient algorithms for cluster editing.

Lucas de O. Bastos, Luiz Satoru Ochi, Fábio Protti, Anand Subramanian, Ivan César Martins, Rian Gabriel S. Pinheiro

J. Comb. Optim., 2016

A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem.

Walton Pereira Coutinho, Roberto Quirino do Nascimento, Artur Alves Pessoa, Anand Subramanian

INFORMS J. Comput., 2016

On solving manufacturing cell formation via Bicluster Editing.

Rian G. S. Pinheiro, Ivan C. Martins, Fábio Protti, Luiz S. Ochi, Luidi Gelabert Simonetti, Anand Subramanian

Eur. J. Oper. Res., 2016

2015

A matheuristic approach for the Pollution-Routing Problem.

Raphael Kramer, Anand Subramanian, Thibaut Vidal, Lucídio dos Anjos F. Cabral

Eur. J. Oper. Res., 2015

A speed and departure time optimization algorithm for the pollution-routing problem.

Raphael Kramer, Nelson Maculan, Anand Subramanian, Thibaut Vidal

Eur. J. Oper. Res., 2015

Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times.

Katyanne Farias, Arthur Kramer, Anand Subramanian

CoRR, 2015

Hybrid metaheuristics for the Clustered Vehicle Routing Problem.

Thibaut Vidal, Maria Battarra, Anand Subramanian, Günes Erdogan

Comput. Oper. Res., 2015

An iterated local search heuristic for the split delivery vehicle routing problem.

Marcos Melo Silva, Anand Subramanian, Luiz Satoru Ochi

Comput. Oper. Res., 2015

Analysis of Path Planning Algorithms Based on Travelling Salesman Problem Embedded in UAVs.

Thiago Werlley Bandeira, Walton Pereira Coutinho, Alisson V. Brito, Anand Subramanian

Proceedings of the 2015 Brazilian Symposium on Computing Systems Engineering, 2015

2014

Exact algorithms for the traveling salesman problem with draft limits.

Maria Battarra, Artur Alves Pessoa, Anand Subramanian, Eduardo Uchoa

Eur. J. Oper. Res., 2014

2013

Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery.

Anand Subramanian, Eduardo Uchoa, Artur Alves Pessoa, Luiz Satoru Ochi

Optim. Lett., 2013

An iterated local search algorithm for the Travelling Salesman Problem with Pickups and Deliveries.

Anand Subramanian, Maria Battarra

J. Oper. Res. Soc., 2013

An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem.

Puca Huachi Vaz Penna, Anand Subramanian, Luiz Satoru Ochi

J. Heuristics, 2013

An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems.

Renaud Masson, Thibaut Vidal, Julien Michallet, Puca Huachi Vaz Penna, Vinicius Petrucci, Anand Subramanian, Hugues Dubedout

Expert Syst. Appl., 2013

A hybrid algorithm for a class of vehicle routing problems.

Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi

Comput. Oper. Res., 2013

Improved bounds for large scale capacitated arc routing problem.

Rafael Martinelli, Marcus Poggi, Anand Subramanian

Comput. Oper. Res., 2013

2012

Exact and heuristic approaches for the set cover with pairs problem.

Luciana Brugiolo Gonçalves, Simone de Lima Martins, Luiz Satoru Ochi, Anand Subramanian

Optim. Lett., 2012

A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem.

Anand Subramanian, Puca Huachi Vaz Penna, Eduardo Uchoa, Luiz Satoru Ochi

Eur. J. Oper. Res., 2012

A simple and effective metaheuristic for the Minimum Latency Problem.

Marcos Melo Silva, Anand Subramanian, Thibaut Vidal, Luiz Satoru Ochi

Eur. J. Oper. Res., 2012

A column generation approach for power-aware optimization of virtualized heterogeneous server clusters.

Hugo Harry Kramer, Vinicius Petrucci, Anand Subramanian, Eduardo Uchoa

Comput. Ind. Eng., 2012

2011

Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery.

Anand Subramanian, Eduardo Uchoa, Artur Alves Pessoa, Luiz Satoru Ochi

Oper. Res. Lett., 2011

2010

A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.

Anand Subramanian, Lúcia M. A. Drummond, Cristiana Bentes, Luiz Satoru Ochi, Ricardo C. Farias

Comput. Oper. Res., 2010

New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery.

Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2008

An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit.

Anand Subramanian, Lucídio dos Anjos Formiga Cabral

Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008