Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2024
A submodular optimization approach to trustworthy loan approval automation
AbstractIn the field of finance, the underwriting process is an essential step in evaluating every loan application. During this stage, the borrowers' creditworthiness and ability to repay the loan are assessed to ultimately decide whether to approve ...
- research-articleNovember 2022
A reinforcement learning approach for multi-fleet aircraft recovery under airline disruption
AbstractAn airline scheduler plans flight schedules with efficient resource utilization. However, unpredictable airline disruptions, such as temporary closures of an airports, cause schedule perturbations. Therefore, recovering disrupted ...
Highlights- We cover the multi-fleet aircraft recovery in cases of airline disruption.
- Q-...
- research-articleMay 2022
Enhanced configurable snapshot: snapshot-based fast booting on NAND flash with lifetime control
SAC '22: Proceedings of the 37th ACM/SIGAPP Symposium on Applied ComputingPages 1166–1175https://doi.org/10.1145/3477314.3507061Having a quick boot time has become a major issue in many consumer electronics to improve a user experience. Although instant on/off with persistent memory claims less than 1 second booting, the maturity of the technology is still in progress and the ...
- research-articleSeptember 2019
Comparative analysis of pattern-based models for the two-dimensional two-stage guillotine cutting stock problem
Computers and Operations Research (CORS), Volume 109, Issue CPages 159–169https://doi.org/10.1016/j.cor.2019.05.005Highlights- Pattern-based models for a two-dimensional two-stage guillotine cutting stock problem are analyzed and compared.
This study presents a theoretical and computational analysis of integer programs based on the concept of the patterns, the so-called pattern-based models, for a two-dimensional two-stage guillotine cutting stock problem. The full-...
- articleOctober 2016
Distribution-robust single-period inventory control problem with multiple unreliable suppliers
This paper presents a distribution-robust approach to the single-period inventory control problem with multiple unreliable suppliers and stochastic demand. Using the mean and covariance that are assumed to be the only known data, the proposed approach ...
- articleMay 2016
Robust optimization approach for a chance-constrained binary knapsack problem
Mathematical Programming: Series A and B (MPRG), Volume 157, Issue 1Pages 277–296https://doi.org/10.1007/s10107-015-0931-0We consider a certain class of chance-constrained binary knapsack problem where each item has a normally distributed random weight that is independent of the other items. For this problem we propose an efficient pseudo-polynomial time algorithm based on ...
- articleJanuary 2015
The Grid Rotation Method and Its Application to the Glove Sizing System
Human Factors in Ergonomics & Manufacturing (HFEM), Volume 25, Issue 1Pages 58–65https://doi.org/10.1002/hfm.20522In this article, we propose a grid rotation method for glove sizing to accommodate a greater fraction of the population with a given number of sizes. The method is based on the optimization of two geometric variables, the rotation degree and the number ...
- articleJuly 2013
Exact Algorithms for a Bandwidth Packing Problem with Queueing Delay Guarantees
INFORMS Journal on Computing (INFORMS-IJOC), Volume 25, Issue 3Pages 585–596https://doi.org/10.1287/ijoc.1120.0523The bandwidth packing problem BWP concerns the selection of calls from a given set and the assignment of one path to each selected call. The ultimate aim of the BWP is to maximize profit while the routings of the selected calls observe the capacity ...
- articleMay 2012
Technical Note---Branch-and-Price-and-Cut Approach to the Robust Network Design Problem Without Flow Bifurcations
This paper presents a robust optimization approach to the network design problem under traffic demand uncertainty. We consider the specific case of the network design problem in which there are several alternatives in edge capacity installations and the ...
- articleFebruary 2010
Integral polyhedra related to integer multicommodity flows on a cycle
Discrete Applied Mathematics (DAMA), Volume 158, Issue 3Pages 235–238https://doi.org/10.1016/j.dam.2009.09.022The integer multicommodity flow problem on a cycle (IMFC) is to find a feasible integral routing of given demands between @k pairs of nodes on a link-capacitated undirected cycle, which is known to be polynomially solvable. Along with integral polyhedra ...
- articleMarch 2009
A compact formulation of the ring loading problem with integer demand splitting
Operations Research Letters (OPERRL), Volume 37, Issue 2Pages 111–113https://doi.org/10.1016/j.orl.2009.01.003The ring loading problem with integer demand splitting is that of routing @k traffic requirements on an undirected ring network. We present a compact polyhedral description of the set of feasible solutions to the problem, whose number of variables and ...
- ArticleMay 2006
Optimization problems in the simulation of multifactor portfolio credit risk
ICCSA'06: Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IIIPages 777–784https://doi.org/10.1007/11751595_82We consider some optimization problems arising in an efficient simulation method for the measurement of the tail of portfolio credit risk. When we apply an importance sampling (IS) technique, it is necessary to characterize the important regions. In ...
- articleMarch 2002
A branch-and-price algorithm for the Steiner tree packing problem
Computers and Operations Research (CORS), Volume 29, Issue 3Pages 221–241https://doi.org/10.1016/S0305-0548(00)00066-6This paper deals with the Steiner tree packing problem. For a given undirected graph G = (V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets (nets), the problem is to find a connection of nets which ...
- articleAugust 2000
Design of local networks using USHRs
Telecommunications Systems (TESY), Volume 14, Issue 1-4Pages 197–217https://doi.org/10.1023/A:1019145501734We consider the problem of designing a local network in a two level telecommunication network. Given one or two hub nodes, central offices (COs) and conduits, the problem is to find a set of unidirectional self healing rings (USHRs) which covers all COs ...
- articleDecember 1996
Design of capacitated networks with tree configurations
This paper considers the problem of designing a capacitated network with a tree configuration (CTP). For a given set of nodes with their capacities,k types of link facilities with various characteristics, and installation cost for connecting each pair ...