default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor S. Litvinchev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j36]Yuriy Stoyan, Georgiy Yaskov
, Tetyana Romanova, Igor S. Litvinchev, José Manuel Velarde Cantú, Mauricio López Acosta:
Packing Spheres into a Minimum-Height Parabolic Container. Axioms 13(6): 396 (2024)- [j35]Andreas Fischer, Igor S. Litvinchev, Tetyana Romanova, Petro Stetsyuk, Georgiy Yaskov:
Packing spheres with quasi-containment conditions. J. Glob. Optim. 90(3): 671-689 (2024) - [j34]Igor S. Litvinchev, Luis Infante, Tetyana Romanova, Alberto Martinez-Noa, Luis Gutierrez:
Packing Soft Convex Polygons in an Optimized Convex Container. Mob. Networks Appl. 29(1): 211-220 (2024) - 2023
- [j33]Zoia Duriagina, Alexander V. Pankratov, Tetyana Romanova, Igor S. Litvinchev, Julia A. Bennell, Igor Lemishka, Sergiy Maximov:
Optimized Packing Titanium Alloy Powder Particles. Comput. 11(2): 22 (2023) - [j32]Josef Kallrath, Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Luis Infante:
Packing convex polygons in minimum-perimeter convex hulls. J. Glob. Optim. 85(1): 39-59 (2023) - [j31]Tatiana E. Romanova, Aleksandr V. Pankratov, Igor S. Litvinchev, Vladimir Dubinskyi, Luis Infante:
Sparse layout of irregular 3D clusters. J. Oper. Res. Soc. 74(1): 351-361 (2023) - 2022
- [j30]Tetyana Romanova, Olexandr Pankratov, Igor S. Litvinchev, Petro Stetsyuk, Oleksii Lykhovyd, Jose Antonio Marmolejo Saucedo, Pandian Vasant:
Balanced Circular Packing Problems with Distance Constraints. Comput. 10(7): 113 (2022) - [j29]Igor S. Litvinchev, Tatiana E. Romanova:
Editorial: Digitization of Organizations: Towards a New Paradigm of Real-Time Systems. Mob. Networks Appl. 27(5): 2170-2171 (2022) - 2021
- [j28]Tatiana E. Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Sergiy Plankovskyy, Yevgen Tsegelnyk, Olga Shypul:
Sparsest balanced packing of irregular 3D objects in a cylindrical container. Eur. J. Oper. Res. 291(1): 84-100 (2021) - [j27]Tatiana E. Romanova, Yuri Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Konstantin Avramov, Marina Chernobryvko, Igor Yanchevskyi, Iryna Mozgova, Julia A. Bennell:
Optimal layout of ellipses and its application for additive manufacturing. Int. J. Prod. Res. 59(2): 560-575 (2021) - [j26]Tatiana E. Romanova, Alexander V. Pankratov, Igor S. Litvinchev, Sergiy Plankovskyy, Yevgen Tsegelnyk, Olga Shypul:
Sparsest packing of two-dimensional objects. Int. J. Prod. Res. 59(13): 3900-3915 (2021) - 2020
- [j25]Pandian Vasant, Gerhard-Wilhelm Weber, Igor S. Litvinchev:
Editorial. Comput. Intell. 36(1): 2-3 (2020) - [j24]Tatiana E. Romanova, Igor S. Litvinchev, Alexander V. Pankratov:
Packing ellipsoids in an optimized cylinder. Eur. J. Oper. Res. 285(2): 429-443 (2020) - [j23]Rémy Dupas, Igor Grebennik, Igor S. Litvinchev, Tatiana E. Romanova, Olga Chorna:
Solution Strategy for One-to-One Pickup and Delivery Problem Using the Cyclic Transfer Approach. EAI Endorsed Trans. Energy Web 7(27): e5 (2020) - [j22]Igor Yanchevskyi, Roland Lachmayer, Iryna Mozgova, René-Bastian Lippert, Georgiy Yaskov, Tatiana E. Romanova, Igor S. Litvinchev:
Circular packing for support-free structures. EAI Endorsed Trans. Energy Web 7(30): e3 (2020) - [j21]Pandian Vasant, Fahad Parvez Mahdi, Jose Antonio Marmolejo Saucedo, Igor S. Litvinchev, Román Rodríguez-Aguilar, Junzo Watada:
Quantum-Behaved Bat Algorithm for Solving the Economic Load Dispatch Problem Considering a Valve-Point Effect. Int. J. Appl. Metaheuristic Comput. 11(3): 41-57 (2020) - [j20]Rafael Torres-Escobar, Jose Antonio Marmolejo Saucedo, Igor S. Litvinchev:
A Metaheuristic Approach and Mathematical Programming for Packing Objects in a Rectangular Container. Int. J. Appl. Metaheuristic Comput. 11(3): 108-119 (2020) - [j19]Timothy Ganesan, Pandian Vasant, Pratik Sanghvi, J. Joshua Thomas, Igor S. Litvinchev:
Random Matrix Generators for Optimizing a Fuzzy Biofuel Supply Chain System. J. Adv. Eng. Comput. 4(1): 33-50 (2020) - [j18]Igor S. Litvinchev, Tatiana E. Romanova, Rogelio Corrales-Diaz, Aned Esquerra-Arguelles, Alberto Martinez-Noa:
Lagrangian Approach to Modeling Placement Conditions in Optimized Packing Problems. Mob. Networks Appl. 25(6): 2126-2133 (2020) - [j17]Rafael Torres-Escobar, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev:
Binary monkey algorithm for approximate packing non-congruent circles in a rectangular container. Wirel. Networks 26(7): 4743-4752 (2020) - [j16]Pandian Vasant, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev, Román Rodríguez-Aguilar:
Nature-inspired meta-heuristics approaches for charging plug-in hybrid electric vehicle. Wirel. Networks 26(7): 4753-4766 (2020) - [j15]Vladimir P. Novik, Ivan A. Matveev, Igor S. Litvinchev:
Enhancing iris template matching with the optimal path method. Wirel. Networks 26(7): 4861-4868 (2020) - [j14]Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev:
Packing ellipses in an optimized rectangular container. Wirel. Networks 26(7): 4869-4879 (2020) - 2019
- [j13]Aleksandr V. Pankratov, Tatiana E. Romanova, Igor S. Litvinchev:
Packing ellipses in an optimized convex polygon. J. Glob. Optim. 75(2): 495-522 (2019) - 2018
- [j12]Paulina Avila-Torres, Rafael Caballero, Igor S. Litvinchev, Fernando López Irarragorri, Pandian Vasant:
The urban transport planning with uncertainty in demand and travel time: a comparison of two defuzzification methods. J. Ambient Intell. Humaniz. Comput. 9(3): 843-856 (2018) - [j11]Nancy M. Arratia Martínez, Rafael Caballero-Fernandez, Igor S. Litvinchev, Fernando López Irarragorri:
Research and development project portfolio selection under uncertainty. J. Ambient Intell. Humaniz. Comput. 9(3): 857-866 (2018) - [j10]Ivan A. Matveev, Vladimir P. Novik, Igor S. Litvinchev:
Influence of degrading factors on the optimal spatial and spectral features of biometric templates. J. Comput. Sci. 25: 419-424 (2018) - 2012
- [j9]Igor S. Litvinchev, Edith Lucero Ozuna Espinosa:
Lagrangian Bounds and a Heuristic for the Two-Stage Capacitated Facility Location Problem. Int. J. Energy Optim. Eng. 1(1): 59-71 (2012) - 2010
- [j8]Igor S. Litvinchev, Miguel Mata Pérez, Socorro Rangel, Jania Saucedo:
Lagrangian heuristic for a class of the generalized assignment problems. Comput. Math. Appl. 60(4): 1115-1123 (2010) - [j7]Igor S. Litvinchev, Socorro Rangel, Jania Saucedo:
A Lagrangian bound for many-to-many assignment problems. J. Comb. Optim. 19(3): 241-257 (2010) - [j6]Igor S. Litvinchev, Fernando López Irarragorri, Ada M. Alvarez, Eduardo Fernández:
Large-Scale Public R&D Portfolio Selection by Maximizing a Biobjective Impact Measure. IEEE Trans. Syst. Man Cybern. Part A 40(3): 572-582 (2010) - 2009
- [j5]Eduardo Fernández, Fernando López Irarragorri, Jorge Navarro, Ines Vega, Igor S. Litvinchev:
An integrated mathematical-computer approach for R&D project selection in large public organisations. Int. J. Math. Oper. Res. 1(3): 372-396 (2009) - 2008
- [j4]Igor S. Litvinchev, Fernando López Irarragorri, Miguel Mata Pérez, Satu Elisa Schaeffer:
Using MILP Tools to Study R&D Portfolio Selection Model for Large Instances in Public and Social Sector. Computación y Sistemas 12(2) (2008) - 2006
- [j3]Igor S. Litvinchev, Socorro Rangel:
Using error bounds to compare aggregated generalized transportation models. Ann. Oper. Res. 146(1): 119-134 (2006) - 2000
- [j2]Igor S. Litvinchev:
On improved Choi-Goldfarb solution-containing ellipsoids in linear programming. Oper. Res. Lett. 27(1): 29-37 (2000) - 1999
- [j1]Igor S. Litvinchev, Socorro Rangel:
Localization of the optimal solution and a posteriori bounds for aggregation. Comput. Oper. Res. 26(10-11): 967-988 (1999)
Conference and Workshop Papers
- 2019
- [c8]Tetyana Romanova, Yurij Stoyan, Alexander V. Pankratov, Igor S. Litvinchev, Jose Antonio Marmolejo Saucedo:
Decomposition Algorithm for Irregular Placement Problems. ICO 2019: 214-221 - [c7]Tatiana E. Romanova, Igor S. Litvinchev, Igor Grebennik, A. Kovalenko, Inna Urniaieva, Sergey Shekhovtsov:
Packing Convex 3D Objects with Special Geometric and Balancing Conditions. ICO 2019: 273-281 - [c6]Georgiy Yaskov, Tetyana Romanova, Igor S. Litvinchev, Sergey Shekhovtsov:
Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem. ICO 2019: 671-678 - 2018
- [c5]Rafael Torres-Escobar, José Antonio Marmolejo-Saucedo, Igor S. Litvinchev, Pandian Vasant:
Monkey Algorithm for Packing Circles with Binary Variables. ICO 2018: 547-559 - 2016
- [c4]Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa:
Using Valid Inequalities and Different Grids in LP-Based Heuristic for Packing Circular Objects. ACIIDS (2) 2016: 681-690 - 2015
- [c3]Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa:
Using Different Norms in Packing Circular Objects. ACIIDS (2) 2015: 540-548 - 2014
- [c2]Igor S. Litvinchev, Luis Infante, Edith Lucero Ozuna Espinosa:
Approximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities. ICCL 2014: 47-60 - 2012
- [c1]Igor S. Litvinchev, Edith Lucero Ozuna Espinosa:
Solving the Two-Stage Capacitated Facility Location Problem by the Lagrangian Heuristic. ICCL 2012: 92-103
Coauthor Index
aka: Alexander V. Pankratov
aka: Tetyana Romanova
aka: José Antonio Marmolejo-Saucedo
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:28 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
