Abhishek Awasthi

According to our database1, Abhishek Awasthi authored at least 16 papers between 2013 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Generative-enhanced optimization for knapsack problems: an industry-relevant study.
CoRR, February, 2025

2024
Effective Embedding of Integer Linear Inequalities for Variational Quantum Algorithms.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2024

Real World Application of Quantum-Classical Optimization for Production Scheduling.
Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2024

2023
A Quantum Optimization Case Study for a Transport Robot Scheduling Problem.
CoRR, 2023

2018
An Exact Time Domain Analysis of DCM Boost Mode LLC Resonant Converter for PV applications.
Proceedings of the IECON 2018, 2018

A generic problem instance generator for discrete optimization problems.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018

2017
A modified boost rectifier for elimination of circulating current in power factor correction applications.
Microelectron. Reliab., 2017

2016
GPGPU-Based Parallel Algorithms for Scheduling Against Due Date.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

Tackling Common Due Window Problem with a Two-Layered Approach.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Un-restricted Common Due-Date Problem with Controllable Processing Times - Linear Algorithm for a Given Job Sequence.
Proceedings of the ICEIS 2015, 2015

2014
A Novel Approach to the Common Due-Date Problem on Single and Parallel Machines.
CoRR, 2014

Common Due-Date Problem: Linear Algorithm for a Given Job Sequence.
Proceedings of the 17th IEEE International Conference on Computational Science and Engineering, 2014

Common Due-Window problem: Polynomial algorithms for a given processing sequence.
Proceedings of the 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems, 2014

2013
Aircraft Landing Problem: Efficient Algorithm for a Given Landing Sequence.
CoRR, 2013

Common Due-Date Problem: Exact Polynomial Algorithms for a Given Job Sequence.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Aircraft Landing Problem: An Efficient Algorithm for a Given Landing Sequence.
Proceedings of the 16th IEEE International Conference on Computational Science and Engineering, 2013


  Loading...