Igor S. Litvinchev

45 papers Journal 37Unranked 8

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Packing Soft Convex Polygons in an Optimized Convex Container. Mob. Networks Appl. Igor S. Litvinchev, Luis Infante, Tetyana Romanova, Alberto Martinez-Noa, Luis Gutierrez
2024	J	`jnl`	Packing Spheres into a Minimum-Height Parabolic Container. Axioms Yuriy Stoyan, Georgiy Yaskov, Tetyana Romanova, Igor S. Litvinchev, José Manuel Velarde Cantú, Mauricio López Acosta
2024	J	`jnl`	Packing spheres with quasi-containment conditions. J. Glob. Optim. Andreas Fischer, Igor S. Litvinchev, Tetyana Romanova, Petro Stetsyuk, Georgiy Yaskov
2024	J	`jnl`	Packing stretched convex polygons in an optimized rectangle. Wirel. Networks Julia A. Bennell, Igor S. Litvinchev, Aleksandr V. Pankratov, Tetyana Romanova
2023	J	`jnl`	Optimized Packing Titanium Alloy Powder Particles. Comput. Zoia Duriagina, Alexander V. Pankratov, Tetyana Romanova, Igor S. Litvinchev, Julia A. Bennell, Igor Lemishka, Sergiy Maximov
2023	J	`jnl`	Packing convex polygons in minimum-perimeter convex hulls. J. Glob. Optim. Josef Kallrath, Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Luis Infante
2023	J	`jnl`	Sparse layout of irregular 3D clusters. J. Oper. Res. Soc. Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Vladimir Dubinskyi, Luis Infante
2022	J	`jnl`	Balanced Circular Packing Problems with Distance Constraints. Comput. Tetyana Romanova, Olexandr Pankratov, Igor S. Litvinchev, Petro Stetsyuk, Oleksii Lykhovyd, Jose Antonio Marmolejo Saucedo, Pandian Vasant
2022	J	`jnl`	Editorial: Digitization of Organizations: Towards a New Paradigm of Real-Time Systems. Mob. Networks Appl. Igor S. Litvinchev, Tatiana E. Romanova
2021	J	`jnl`	Optimal layout of ellipses and its application for additive manufacturing. Int. J. Prod. Res. Tatiana E. Romanova, Yuri Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Konstantin Avramov, Marina Chernobryvko, Igor Yanchevskyi, Iryna Mozgova, Julia A. Bennell
2021	J	`jnl`	Sparsest balanced packing of irregular 3D objects in a cylindrical container. Eur. J. Oper. Res. Tatiana E. Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Sergiy Plankovskyy, Yevgen Tsegelnyk, Olga Shypul
2021	J	`jnl`	Sparsest packing of two-dimensional objects. Int. J. Prod. Res. Tatiana E. Romanova, Alexander V. Pankratov, Igor S. Litvinchev, Sergiy Plankovskyy, Yevgen Tsegelnyk, Olga Shypul
2020	J	`jnl`	A Metaheuristic Approach and Mathematical Programming for Packing Objects in a Rectangular Container. Int. J. Appl. Metaheuristic Comput. Rafael Torres-Escobar, Jose Antonio Marmolejo Saucedo, Igor S. Litvinchev
2020	J	`jnl`	Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wirel. Networks Rafael Torres-Escobar, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev
2020	J	`jnl`	Circular packing for support-free structures. EAI Endorsed Trans. Energy Web Igor Yanchevskyi, Roland Lachmayer, Iryna Mozgova, René-Bastian Lippert, Georgiy Yaskov, Tatiana E. Romanova, Igor S. Litvinchev
2020	J	`jnl`	Editorial. Comput. Intell. Pandian Vasant, Gerhard-Wilhelm Weber, Igor S. Litvinchev
2020	J	`jnl`	Enhancing iris template matching with the optimal path method. Wirel. Networks Vladimir P. Novik, Ivan A. Matveev, Igor S. Litvinchev
2020	J	`jnl`	Lagrangian Approach to Modeling Placement Conditions in Optimized Packing Problems. Mob. Networks Appl. Igor S. Litvinchev, Tatiana E. Romanova, Rogelio Corrales-Diaz, Aned Esquerra-Arguelles, Alberto Martinez-Noa
2020	J	`jnl`	Nature-inspired meta-heuristics approaches for charging plug-in hybrid electric vehicle. Wirel. Networks Pandian Vasant, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev, Román Rodríguez-Aguilar
2020	J	`jnl`	Packing ellipses in an optimized rectangular container. Wirel. Networks Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev
2020	J	`jnl`	Packing ellipsoids in an optimized cylinder. Eur. J. Oper. Res. Tatiana E. Romanova, Igor S. Litvinchev, Alexander V. Pankratov
2020	J	`jnl`	Quantum-Behaved Bat Algorithm for Solving the Economic Load Dispatch Problem Considering a Valve-Point Effect. Int. J. Appl. Metaheuristic Comput. Pandian Vasant, Fahad Parvez Mahdi, Jose Antonio Marmolejo Saucedo, Igor S. Litvinchev, Román Rodríguez-Aguilar, Junzo Watada
2020	J	`jnl`	Random Matrix Generators for Optimizing a Fuzzy Biofuel Supply Chain System. J. Adv. Eng. Comput. Timothy Ganesan, Pandian Vasant, Pratik Sanghvi, J. Joshua Thomas, Igor S. Litvinchev
2020	J	`jnl`	Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach. EAI Endorsed Trans. Energy Web Rémy Dupas, Igor Grebennik, Igor S. Litvinchev, Tatiana E. Romanova, Olga Chorna
2019	—	`conf`	Decomposition Algorithm for Irregular Placement Problems. ICO Tetyana Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Jose Antonio Marmolejo Saucedo
2019	—	`conf`	Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem. ICO Georgiy Yaskov, Tetyana Romanova, Igor S. Litvinchev, Sergey Shekhovtsov
2019	—	`conf`	Packing Convex 3D Objects with Special Geometric and Balancing Conditions. ICO Tatiana E. Romanova, Igor S. Litvinchev, Igor Grebennik, A. Kovalenko, Inna Urniaieva, Sergey Shekhovtsov
2019	J	`jnl`	Packing ellipses in an optimized convex polygon. J. Glob. Optim. Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev
2018	J	`jnl`	Influence of degrading factors on the optimal spatial and spectral features of biometric templates. J. Comput. Sci. Ivan A. Matveev, Vladimir P. Novik, Igor S. Litvinchev
2018	—	`conf`	Monkey Algorithm for Packing Circles with Binary Variables. ICO Rafael Torres-Escobar, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev, Pandian Vasant
2018	J	`jnl`	Research and development project portfolio selection under uncertainty. J. Ambient Intell. Humaniz. Comput. Nancy M. Arratia Martínez, Rafael Caballero-Fernandez, Igor S. Litvinchev, Fernando López Irarragorri
2018	J	`jnl`	The urban transport planning with uncertainty in demand and travel time: a comparison of two defuzzification methods. J. Ambient Intell. Humaniz. Comput. Paulina Avila-Torres, Rafael Caballero, Igor S. Litvinchev, Fernando López Irarragorri, Pandian Vasant
2016	—	`conf`	Using Valid Inequalities and Different Grids in LP-Based Heuristic for Packing Circular Objects. ACIIDS (2) Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa
2015	—	`conf`	Using Different Norms in Packing Circular Objects. ACIIDS (2) Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa
2014	—	`conf`	Approximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities. ICCL Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa
2012	J	`jnl`	Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem. Int. J. Energy Optim. Eng. Igor S. Litvinchev, Edith Lucero Ozuna Espinosa
2012	—	`conf`	Solving the Two-Stage Capacitated Facility Location Problem by the Lagrangian Heuristic. ICCL Igor S. Litvinchev, Edith Lucero Ozuna Espinosa
2010	J	`jnl`	A Lagrangian bound for many-to-many assignment problems. J. Comb. Optim. Igor S. Litvinchev, Socorro Rangel, Jania Saucedo
2010	J	`jnl`	Lagrangian heuristic for a class of the generalized assignment problems. Comput. Math. Appl. Igor S. Litvinchev, Miguel Mata Pérez, Socorro Rangel, Jania Saucedo
2010	J	`jnl`	Large-Scale Public R&D Portfolio Selection by Maximizing a Biobjective Impact Measure. IEEE Trans. Syst. Man Cybern. Part A Igor S. Litvinchev, Fernando López Irarragorri, Ada M. Alvarez, Eduardo Fernández
2009	J	`jnl`	An integrated mathematical-computer approach for R&D project selection in large public organisations. Int. J. Math. Oper. Res. Eduardo Fernández, Fernando López Irarragorri, Jorge Navarro, Ines Vega, Igor S. Litvinchev
2008	J	`jnl`	Using MILP Tools to Study R&D Portfolio Selection Model for Large Instances in Public and Social Sector. Computación y Sistemas Igor S. Litvinchev, Fernando López Irarragorri, Miguel Mata Pérez, Satu Elisa Schaeffer
2006	J	`jnl`	Using error bounds to compare aggregated generalized transportation models. Ann. Oper. Res. Igor S. Litvinchev, Socorro Rangel
2000	J	`jnl`	On improved Choi-Goldfarb solution-containing ellipsoids in linear programming. Oper. Res. Lett. Igor S. Litvinchev
1999	J	`jnl`	Localization of the optimal solution and a posteriori bounds for aggregation. Comput. Oper. Res. Igor S. Litvinchev, Socorro Rangel