Igor S. Litvinchev

According to our database, Igor S. Litvinchev authored at least 45 papers between 1999 and 2024.

Collaborative distances:

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

2024

Packing stretched convex polygons in an optimized rectangle.

Julia A. Bennell, Igor S. Litvinchev, Aleksandr V. Pankratov, Tetyana Romanova

Wirel. Networks, November, 2024

Packing spheres with quasi-containment conditions.

Andreas Fischer, Igor S. Litvinchev, Tetyana Romanova, Petro Stetsyuk, Georgiy Yaskov

J. Glob. Optim., November, 2024

Packing Spheres into a Minimum-Height Parabolic Container.

Yuriy Stoyan, Georgiy Yaskov, Tetyana Romanova, Igor S. Litvinchev, José Manuel Velarde Cantú, Mauricio López Acosta

Axioms, June, 2024

Packing Soft Convex Polygons in an Optimized Convex Container.

Igor S. Litvinchev, Luis Infante, Tetyana Romanova, Alberto Martinez-Noa, Luis Gutierrez

Mob. Networks Appl., February, 2024

2023

Optimized Packing Titanium Alloy Powder Particles.

Zoia Duriagina, Alexander V. Pankratov, Tetyana Romanova, Igor S. Litvinchev, Julia A. Bennell, Igor Lemishka, Sergiy Maximov

Comput., February, 2023

Sparse layout of irregular 3D clusters.

Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Vladimir Dubinskyi, Luis Infante

J. Oper. Res. Soc., January, 2023

Packing convex polygons in minimum-perimeter convex hulls.

Josef Kallrath, Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Luis Infante

J. Glob. Optim., 2023

2022

Editorial: Digitization of Organizations: Towards a New Paradigm of Real-Time Systems.

Igor S. Litvinchev, Tatiana E. Romanova

Mob. Networks Appl., 2022

Balanced Circular Packing Problems with Distance Constraints.

Tetyana Romanova, Olexandr Pankratov, Igor S. Litvinchev, Petro Stetsyuk, Oleksii Lykhovyd, Jose Antonio Marmolejo Saucedo, Pandian Vasant

Comput., 2022

2021

Optimal layout of ellipses and its application for additive manufacturing.

Tatiana E. Romanova, Yuri Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Konstantin Avramov, Marina Chernobryvko, Igor Yanchevskyi, Iryna Mozgova, Julia A. Bennell

Int. J. Prod. Res., 2021

Sparsest packing of two-dimensional objects.

Tatiana E. Romanova, Alexander V. Pankratov, Igor S. Litvinchev, Sergiy Plankovskyy, Yevgen Tsegelnyk, Olga Shypul

Int. J. Prod. Res., 2021

Sparsest balanced packing of irregular 3D objects in a cylindrical container.

Tatiana E. Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Sergiy Plankovskyy, Yevgen Tsegelnyk, Olga Shypul

Eur. J. Oper. Res., 2021

2020

Nature-inspired meta-heuristics approaches for charging plug-in hybrid electric vehicle.

Pandian Vasant, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev, Román Rodríguez-Aguilar

Wirel. Networks, 2020

Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container.

Rafael Torres-Escobar, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev

Wirel. Networks, 2020

Packing ellipses in an optimized rectangular container.

Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev

Wirel. Networks, 2020

Enhancing iris template matching with the optimal path method.

Vladimir P. Novik, Ivan A. Matveev, Igor S. Litvinchev

Wirel. Networks, 2020

Lagrangian Approach to Modeling Placement Conditions in Optimized Packing Problems.

Igor S. Litvinchev, Tatiana E. Romanova, Rogelio Corrales-Diaz, Aned Esquerra-Arguelles, Alberto Martinez-Noa

Mob. Networks Appl., 2020

Random Matrix Generators for Optimizing a Fuzzy Biofuel Supply Chain System.

Timothy Ganesan, Pandian Vasant, Pratik Sanghvi, J. Joshua Thomas, Igor S. Litvinchev

J. Adv. Eng. Comput., 2020

Quantum-Behaved Bat Algorithm for Solving the Economic Load Dispatch Problem Considering a Valve-Point Effect.

Pandian Vasant, Fahad Parvez Mahdi, Jose Antonio Marmolejo Saucedo, Igor S. Litvinchev, Román Rodríguez-Aguilar, Junzo Watada

Int. J. Appl. Metaheuristic Comput., 2020

A Metaheuristic Approach and Mathematical Programming for Packing Objects in a Rectangular Container.

Rafael Torres-Escobar, Jose Antonio Marmolejo Saucedo, Igor S. Litvinchev

Int. J. Appl. Metaheuristic Comput., 2020

Circular packing for support-free structures.

Igor Yanchevskyi, Roland Lachmayer, Iryna Mozgova, René-Bastian Lippert, Georgiy Yaskov, Tatiana E. Romanova, Igor S. Litvinchev

EAI Endorsed Trans. Energy Web, 2020

Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach.

Rémy Dupas, Igor Grebennik, Igor S. Litvinchev, Tatiana E. Romanova, Olga Chorna

EAI Endorsed Trans. Energy Web, 2020

Packing ellipsoids in an optimized cylinder.

Tatiana E. Romanova, Igor S. Litvinchev, Alexander V. Pankratov

Eur. J. Oper. Res., 2020

Editorial.

Pandian Vasant, Gerhard-Wilhelm Weber, Igor S. Litvinchev

Comput. Intell., 2020

2019

Packing ellipses in an optimized convex polygon.

Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev

J. Glob. Optim., 2019

Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem.

Georgiy Yaskov, Tetyana Romanova, Igor S. Litvinchev, Sergey Shekhovtsov

ICO, 2019

Decomposition Algorithm for Irregular Placement Problems.

Tetyana Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Jose Antonio Marmolejo Saucedo

ICO, 2019

Packing Convex 3D Objects with Special Geometric and Balancing Conditions.

Tatiana E. Romanova, Igor S. Litvinchev, Igor Grebennik, A. Kovalenko, Inna Urniaieva, Sergey Shekhovtsov

ICO, 2019

2018

Influence of degrading factors on the optimal spatial and spectral features of biometric templates.

Ivan A. Matveev, Vladimir P. Novik, Igor S. Litvinchev

J. Comput. Sci., 2018

Research and development project portfolio selection under uncertainty.

Nancy M. Arratia Martínez, Rafael Caballero-Fernandez, Igor S. Litvinchev, Fernando López Irarragorri

J. Ambient Intell. Humaniz. Comput., 2018

The urban transport planning with uncertainty in demand and travel time: a comparison of two defuzzification methods.

Paulina Avila-Torres, Rafael Caballero, Igor S. Litvinchev, Fernando López Irarragorri, Pandian Vasant

J. Ambient Intell. Humaniz. Comput., 2018

Monkey Algorithm for Packing Circles with Binary Variables.

Rafael Torres-Escobar, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev, Pandian Vasant

ICO, 2018

2016

Using Valid Inequalities and Different Grids in LP-Based Heuristic for Packing Circular Objects.

Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa

Proceedings of the Intelligent Information and Database Systems - 8th Asian Conference, 2016

2015

Using Different Norms in Packing Circular Objects.

Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa

Proceedings of the Intelligent Information and Database Systems - 7th Asian Conference, 2015

2014

Approximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities.

Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa

Proceedings of the Computational Logistics - 5th International Conference, 2014

2012

Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem.

Igor S. Litvinchev, Edith Lucero Ozuna Espinosa

Int. J. Energy Optim. Eng., 2012

Solving the Two-Stage Capacitated Facility Location Problem by the Lagrangian Heuristic.

Igor S. Litvinchev, Edith Lucero Ozuna Espinosa

Proceedings of the Computational Logistics - Third International Conference, 2012

2010

Large-Scale Public R&D Portfolio Selection by Maximizing a Biobjective Impact Measure.

Igor S. Litvinchev, Fernando López Irarragorri, Ada M. Alvarez, Eduardo Fernández

IEEE Trans. Syst. Man Cybern. Part A, 2010

A Lagrangian bound for many-to-many assignment problems.

Igor S. Litvinchev, Socorro Rangel, Jania Saucedo

J. Comb. Optim., 2010

Lagrangian heuristic for a class of the generalized assignment problems.

Igor S. Litvinchev, Miguel Mata Pérez, Socorro Rangel, Jania Saucedo

Comput. Math. Appl., 2010

2009

An integrated mathematical-computer approach for R&D project selection in large public organisations.

Eduardo Fernández, Fernando López Irarragorri, Jorge Navarro, Ines Vega, Igor S. Litvinchev

Int. J. Math. Oper. Res., 2009

2008

Using MILP Tools to Study R&D Portfolio Selection Model for Large Instances in Public and Social Sector.

Igor S. Litvinchev, Fernando López Irarragorri, Miguel Mata Pérez, Satu Elisa Schaeffer

Computación y Sistemas, 2008

2006

Using error bounds to compare aggregated generalized transportation models.

Igor S. Litvinchev, Socorro Rangel

Ann. Oper. Res., 2006

2000

On improved Choi-Goldfarb solution-containing ellipsoids in linear programming.

Igor S. Litvinchev

Oper. Res. Lett., 2000

1999

Localization of the optimal solution and a posteriori bounds for aggregation.

Igor S. Litvinchev, Socorro Rangel

Comput. Oper. Res., 1999