Article
Management
Pierre Bonami, Andrea Lodi, Giulia Zarpellon
Summary: This study aims to fully integrate learned predictions into the algorithmic design of a mixed-integer quadratic programming solver. By using machine learning techniques, they address the problem of linearizing convex MIQPs by translating it into a classification task. Their approach involves careful target and feature engineering, as well as computational experiments and evaluation metrics.
OPERATIONS RESEARCH
(2022)
Article
Computer Science, Information Systems
Junyou Ye, Zhixia Yang, Mengping Ma, Yulan Wang, Xiaomei Yang
Summary: In this paper, a new regression method called epsilon-kernel-free soft quadratic surface support vector regression (epsilon-SQSSVR) is proposed. The method converts the regression problem into a classification problem and constructs an optimization problem based on maximizing the sum of relative geometrical margin of each training point. The model is nonlinear, kernel-free, and highly interpretable.
INFORMATION SCIENCES
(2022)
Article
Operations Research & Management Science
Nacera Maachou, Mustapha Moulai
Summary: This article proposes a new algorithm for solving the integer indefinite quadratic bilevel problem, using branch and bound method with cuts to determine the set of efficient solutions, and checking the integer optimal solution found for optimality of the main problem by solving the lower level problem.
ANNALS OF OPERATIONS RESEARCH
(2022)
Article
Automation & Control Systems
Antoine Dedieu, Hussein Hazimeh, Rahul Mazumder
Summary: This study utilizes mixed-integer programming to solve l(0)-regularized regression problems, introduces new scalable algorithms, and presents new estimation error bounds. Experimental results demonstrate significant improvements in statistical performance compared to competing methods.
JOURNAL OF MACHINE LEARNING RESEARCH
(2021)
Article
Mathematics
Francisco Fernandez-Navarro, Luisa Martinez-Nieto, Mariano Carbonero-Ruz, Teresa Montero-Romero
Summary: This paper introduces the mean-variance (MV) portfolio and mean squared variance (MSV) portfolio methods, and proposes a mixed-integer linear programming (MILP) reformation for the non-convex QP problem, as well as a data-driven method for determining the optimal value of the hyper-parameter. Empirical tests show that the MSV portfolio exhibits competitive performance in most problems.
Article
Computer Science, Artificial Intelligence
Marta Baldomero-Naranjo, Luisa I. Martinez-Merino, Antonio M. Rodriguez-Chia
Summary: This paper introduces a robust classification model based on SVM that addresses outliers detection and feature selection simultaneously, using exact and heuristic approaches for solution. The quality of solutions provided by these methods are compared and the efficiency of the model is demonstrated by testing and comparing with existing SVM-based models.
EXPERT SYSTEMS WITH APPLICATIONS
(2021)
Article
Computer Science, Software Engineering
Carlos J. Nohra, Arvind U. Raghunathan, Nikolaos Sahinidis
Summary: This study proposes a new method for global optimization of nonconvex mixed-integer quadratic programs, using convex quadratic relaxations derived via quadratic cuts. Experimental results demonstrate a significant improvement in the performance of BARON with these relaxations.
MATHEMATICAL PROGRAMMING
(2022)
Article
Operations Research & Management Science
Jacek Gondzio, E. Alper Yildirim
Summary: This paper investigates how to reformulate a standard quadratic program as a mixed integer linear programming problem, proposing two alternative formulations. By utilizing binary variables and valid inequalities, the formulations significantly outperform other global solution approaches in extensive computational results.
JOURNAL OF GLOBAL OPTIMIZATION
(2021)
Article
Operations Research & Management Science
Benjamin Beach, Robert Hildebrand, Joey Huchette
Summary: In this paper, a technique for generating valid dual bounds for nonconvex quadratic optimization problems is presented. The approach combines a piecewise linear approximation for univariate quadratic functions with a diagonal perturbation technique and mixed-integer programming. The proposed method outperforms existing MIP relaxations and exact solvers in terms of bounds and computational efficiency.
JOURNAL OF GLOBAL OPTIMIZATION
(2022)
Article
Computer Science, Artificial Intelligence
Xin Yan, Hongmiao Zhu
Summary: This paper proposes a novel support vector machine model with feature mapping and kernel trick to handle datasets with different distributions. The model improves robustness by pre-selecting training points, and converts the problem into a convex quadratic programming problem solved efficiently by the sequential minimal optimization algorithm. Numerical tests demonstrate the superior performance of the proposed method compared to other classification methods.
KNOWLEDGE-BASED SYSTEMS
(2022)
Article
Computer Science, Software Engineering
Thomas Kleinert, Veronika Grimm, Martin Schmidt
Summary: The paper investigates MIQP-QP bilevel optimization problems, transforming the lower level to yield an equivalent nonconvex single-level reformulation of the original problem and proposing cutting-plane algorithms based on outer-approximation. These methods are capable of solving bilevel instances with several thousand variables and constraints, outperforming traditional approaches significantly.
MATHEMATICAL PROGRAMMING
(2021)
Article
Computer Science, Artificial Intelligence
Abolfazl Hasanzadeh Shadiani, Mahdi Aliyari Shoorehdeli
Summary: This paper proposes an online approach for twin support vector machine, which utilizes recursive relation to avoid repetitive calculation of inverse matrices, resulting in improved training efficiency and maintained accuracy. Experimental results demonstrate the effectiveness of this method.
NEURAL PROCESSING LETTERS
(2023)
Article
Mathematics, Applied
Prerna, Vikas Sharma
Summary: This paper presents a novel method for optimizing a quadratic function over the efficient set of a multi-objective integer linear programming problem. The method obtains a globally optimal solution by ranking and efficiency testing, and demonstrates high computational efficiency.
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS
(2024)
Article
Economics
Yue Zu, Ruhollah Heydari, Kiran Chahar, Yudi Pranoto, Clark Cheng
Summary: This article presents a novel solution called Pre-blocking through Re-waybilling to minimize railcar cuts in freight railways by re-assigning empty railcars to customers, while considering supply, demand, and feasibility constraints.
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW
(2022)
Article
Computer Science, Artificial Intelligence
Sebastian Maldonado, Carla Vairetti, Katherine Jara, Miguel Carrasco, Julio Lopez
Summary: This paper proposes a novel adaptive loss function to enhance the performance of deep learning in classification tasks. By introducing aggregation operators and redefining the cross-entropy loss, it effectively addresses class-level noise conditions and class imbalance, improving classification accuracy.
KNOWLEDGE-BASED SYSTEMS
(2023)
Article
Statistics & Probability
Victor Blanco, Alberto Japon, Justo Puerto
Summary: This paper introduces a new methodology for constructing Optimal Classification Trees that takes into account noisy labels in the training sample. The approach combines margin based classifiers and outlier detection techniques, aiming to maximize separation margin between classes and detect label noise during tree construction. A Mixed Integer Non Linear Programming formulation is presented and tested on standard datasets, showing improved accuracy and AUC compared to existing benchmarks.
ADVANCES IN DATA ANALYSIS AND CLASSIFICATION
(2022)
Article
Management
Victor Blanco, Ricardo Gazquez, Diego Ponce, Justo Puerto
Summary: This paper addresses the Continuous Multifacility Monotone Ordered Median Problem and proposes a new branch-and-price procedure and three families of matheuristics. The study shows that the branch-and-price approach outperforms the compact formulation in medium-sized instances, while the matheuristics yield satisfactory results for larger instances.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Management
Yolanda Hinojosa, Alfredo Marin, Justo Puerto
Summary: This paper focuses on the Dynamically Second-preferred p-center Problem (DSpP), considering customers' preferences and subsets of acceptable service centers. It proposes three mixed-integer linear programming formulations and a heuristic algorithm to solve the NP-hard problem, aiming to minimize the distances and evaluate the usefulness of the formulations with extensive computational experiments. The research provides valuable insights for solving DSpP efficiently.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Artificial Intelligence
Jose J. Calvino, Elena Fernandez, Miguel Lopez-Haro, Juan M. Munoz-Ocana, Antonio M. Rodriguez-Chia
Summary: This paper introduces an l(1)-norm model based on Total Variation Minimization for tomographic reconstruction. The reconstructions produced by this model are more accurate than classical reconstruction models based on the l(2)-norm. The model can be linearized and solved using linear programming, and the dimension of the formulation can be further reduced by exploiting complementary slackness conditions.
EXPERT SYSTEMS WITH APPLICATIONS
(2023)
Article
Computer Science, Interdisciplinary Applications
I. Espejo, R. Paez, J. Puerto, A. M. Rodriguez-Chia
Summary: This paper investigates variants of classical facility location problems on graphs with non-convex neighborhoods for customers and facilities. The p-median, p-center, and p-maximal covering versions of this problem are analyzed. The lengths of arcs depend on the locations of points in the neighborhoods, and different mixed-integer non-linear programming formulations are proposed assuming the neighborhoods are Mixed-Integer Second Order Cone representable. Solution procedures providing bounds and a preprocessing phase are developed to reduce variables and constraints. Extensive computational experiments are reported.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Brenda Cobena, Ivan Contreras, Luisa I. Martinez-Merino, Antonio M. Rodriguez-Chia
Summary: This paper presents an extension of the hub line location problem that takes into account demand elasticity. The proposed model aims to capture the impact of the hub network topology on demand and maximize revenue generated by each unit of demand. Nonlinear and linear programming formulations are presented to solve the problem, with computational results comparing the proposed formulations and demonstrating the advantages of the model. Additionally, a sensitivity analysis study is conducted using real data from Montreal, Canada, to showcase the added value of incorporating demand elasticity in the proposed model for public transportation planning.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Inmaculada Espejo, Alfredo Marin, Juan M. Munoz-Ocana, Antonio M. Rodriguez-Chia
Summary: This article introduces a new compact formulation for uncapacitated single-allocation hub location problems, which has fewer variables than the previous Integer Linear Programming formulations in the literature. This formulation can handle costs that are not based on distances and do not satisfy triangle inequality. The authors also develop different families of valid inequalities to strengthen the formulation, and design a branch-and-cut algorithm based on a relaxed version of the formulation. Extensive computational results demonstrate the efficiency of their methodology in solving large-scale instances in competitive times when compared to the most recent and efficient exact algorithms for single-allocation hub location problems.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Interdisciplinary Applications
Lavinia Amorosi, Justo Puerto, Carlos Valverde
Summary: This paper addresses the optimization problems in coordinating a mothership vehicle and a fleet of drones. The goal is to minimize the mothership's overall travel time while satisfying requirements in terms of fractions of visits to target graphs. Exact formulations and a matheuristic algorithm are developed and compared on test instances, demonstrating the usefulness of the methodology in different scenarios.
COMPUTERS & OPERATIONS RESEARCH
(2023)
Article
Computer Science, Hardware & Architecture
Elena Fernandez, Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari
Summary: This article addresses the problem of partitioning a graph into p connected components by optimizing balancing objective functions related to vertex weights. It introduces the notion of aggregated gap, which is the sum of the differences between vertex weights and the minimum weight of a vertex in a component. New connected p-partitioning problems based on aggregated gap are studied, and their NP-hardness results on general graphs are given. Mathematical programming formulations, adopting flow-based constraints for connectivity modeling, are proposed for these problems. Extensive computational tests on squared grids and randomly generated graphs are conducted to compare the performance of different formulations.
Article
Management
Miguel A. Pozo, Justo Puerto, Ignacio Roldan
Summary: This paper addresses the biobjective versions of the perfect matching problem (PMP) and the Chinese postman problem (CPP). It solves both problems using integer formulations or separating blossom inequalities, taking advantage of the PMP relationship with the CPP. The authors first find the set of supported nondominated solutions and use them to obtain the nonsupported ones. The supported nondominated solutions are obtained by solving scalarized integer formulations. To obtain the nonsupported solutions, lexicographic problems based on adding additional linear constraints to the original problems are solved.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Artificial Intelligence
Lavinia Amorosi, Tullia Padellini, Justo Puerto, Carlos Valverde
Summary: This article discusses recent developments in the interplay between Operational Research and Statistics and how it utilizes advances in Mixed-Integer Optimisation solvers to improve the quality of statistical analysis. The authors propose a new technique for encoding sparsity in Canonical Correlation Analysis and evaluate its performance on multiple datasets. The results highlight that the proposed approach outperforms other conventional methods in finding optimal solutions.
EXPERT SYSTEMS WITH APPLICATIONS
(2024)
Article
Computer Science, Artificial Intelligence
Hao Yang, Min Wang, Zhengfei Yu, Hang Zhang, Jinshen Jiang, Yun Zhou
Summary: In this paper, a novel method called CSTTA is proposed for test time adaptation (TTA), which utilizes confidence-based optimization and sample reweighting to better utilize sample information. Extensive experiments demonstrate the effectiveness of the proposed method.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Jin Liu, Ju-Sheng Mi, Dong-Yun Niu
Summary: This article focuses on a novel method for generating a canonical basis for decision implications based on object-induced operators (OE operators). The logic of decision implication based on OE operators is described, and a method for obtaining the canonical basis for decision implications is given. The completeness, nonredundancy, and optimality of the canonical basis are proven. Additionally, a method for generating true premises based on OE operators is proposed.
KNOWLEDGE-BASED SYSTEMS
(2024)
Review
Computer Science, Artificial Intelligence
Kun Bu, Yuanchao Liu, Xiaolong Ju
Summary: This paper discusses the importance of sentiment analysis and pre-trained models in natural language processing, and explores the application of prompt learning. The research shows that prompt learning is more suitable for sentiment analysis tasks and can achieve good performance.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Xiangjun Cai, Dagang Li
Summary: This paper presents a new decomposition mechanism based on learned decomposition mapping. By using a neural network to learn the relationship between original time series and decomposed results, the repetitive computation overhead during rolling decomposition is relieved. Additionally, extended mapping and partial decomposition methods are proposed to alleviate boundary effects on prediction performance. Comparative studies demonstrate that the proposed method outperforms existing RDEMs in terms of operation speed and prediction accuracy.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Xu Wu, Yang Liu, Jie Tian, Yuanpeng Li
Summary: This paper proposes a blockchain-based privacy-preserving trust management architecture, which adopts federated learning to train task-specific trust models and utilizes differential privacy to protect device privacy. In addition, a game theory-based incentive mechanism and a parallel consensus protocol are proposed to improve the accuracy of trust computing and the efficiency of consensus.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Zaiyang Yu, Prayag Tiwari, Luyang Hou, Lusi Li, Weijun Li, Limin Jiang, Xin Ning
Summary: This study introduces a 3D view-based approach that effectively handles occlusions and leverages the geometric information of 3D objects. The proposed method achieves state-of-the-art results on occluded ReID tasks and exhibits competitive performance on holistic ReID tasks.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Yongliang Shi, Runyi Yang, Zirui Wu, Pengfei Li, Caiyun Liu, Hao Zhao, Guyue Zhou
Summary: Neural implicit representations have gained attention due to their expressive, continuous, and compact properties. However, there is still a lack of research on city-scale continual implicit dense mapping based on sparse LiDAR input. In this study, a city-scale continual neural mapping system with a panoptic representation is developed, incorporating environment-level and instance-level modeling. A tailored three-layer sampling strategy and category-specific prior are proposed to address the challenges of representing geometric information in city-scale space and achieving high fidelity mapping of instances under incomplete observation.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Ruihan Hu, Zhi-Ri Tang, Rui Yang, Zhongjie Wang
Summary: Mesh data is crucial for 3D computer vision applications worldwide, but traditional deep learning frameworks have struggled with handling meshes. This paper proposes MDSSN, a simple mesh computation framework that models triangle meshes and represents their shape using face-based and edge-based Riemannian graphs. The framework incorporates end-to-end operators inspired by traditional deep learning frameworks, and includes dedicated modules for addressing challenges in mesh classification and segmentation tasks. Experimental results demonstrate that MDSSN outperforms other state-of-the-art approaches.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Buliao Huang, Yunhui Zhu, Muhammad Usman, Huanhuan Chen
Summary: This paper proposes a novel semi-supervised conditional normalizing flow (SSCFlow) algorithm that combines unsupervised imputation and supervised classification. By estimating the conditional distribution of incomplete instances, SSCFlow facilitates imputation and classification simultaneously, addressing the issue of separated tasks ignoring data distribution and label information in traditional methods.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Deeksha Varshney, Asif Ekbal, Erik Cambria
Summary: This paper focuses on the neural-based interactive dialogue system that aims to engage and retain humans in long-lasting conversations. It proposes a new neural generative model that combines step-wise co-attention, self-attention-based transformer network, and an emotion classifier to control emotion and knowledge transfer during response generation. The results from quantitative, qualitative, and human evaluation show that the proposed models can generate natural and coherent sentences, capturing essential facts with significant improvement over emotional content.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Junchen Ye, Weimiao Li, Zhixin Zhang, Tongyu Zhu, Leilei Sun, Bowen Du
Summary: Modeling multivariate time series has long been a topic of interest for scholars in various fields. This paper introduces MvTS, an open library based on Pytorch, which provides a unified framework for implementing and evaluating these models. Extensive experiments on public datasets demonstrate the effectiveness and universality of the models reproduced by MvTS.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Reham R. Mostafa, Ahmed M. Khedr, Zaher Al Aghbari, Imad Afyouni, Ibrahim Kamel, Naveed Ahmed
Summary: Feature selection is crucial in classification procedures, but it faces challenges in high-dimensional datasets. To overcome these challenges, this study proposes an Adaptive Hybrid-Mutated Differential Evolution method that incorporates the mechanics of the Spider Wasp Optimization algorithm and the concept of Enhanced Solution Quality. Experimental results demonstrate the effectiveness of the method in terms of accuracy and convergence speed, and it outperforms contemporary cutting-edge algorithms.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Ti Xiang, Pin Lv, Liguo Sun, Yipu Yang, Jiuwu Hao
Summary: This paper introduces a Track Classification Model (TCM) based on marine radar, which can effectively recognize and classify shipping tracks. By using a feature extraction network with multi-feature fusion and a dataset production method to address missing labels, the classification accuracy is improved, resulting in successful engineering application in real scenarios.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Zhihao Zhang, Yuan Zuo, Chenghua Lin, Junjie Wu
Summary: This paper proposes a novel unsupervised context-aware quality phrase mining framework called LMPhrase, which is built upon large pre-trained language models. The framework mines quality phrases as silver labels using a parameter-free probing technique on the pre-trained language model BERT, and formalizes the phrase tagging task as a sequence generation problem by fine-tuning on the Sequence to-Sequence pre-trained language model BART. The results of extensive experiments show that LMPhrase consistently outperforms existing competitors in two different granularity phrase mining tasks.
KNOWLEDGE-BASED SYSTEMS
(2024)
Article
Computer Science, Artificial Intelligence
Kemal Buyukkaya, M. Ozan Karsavuran, Cevdet Aykanat
Summary: The study aims to investigate the hybrid parallelization of the Stochastic Gradient Descent (SGD) algorithm for solving the matrix completion problem on a high-performance computing platform. A hybrid parallel decentralized SGD framework with asynchronous inter-process communication and a novel flexible partitioning scheme is proposed to achieve scalability up to hundreds of processors. Experimental results on real-world benchmark datasets show that the proposed algorithm achieves 6x higher throughput on sparse datasets compared to the state-of-the-art, while achieving comparable throughput on relatively dense datasets.
KNOWLEDGE-BASED SYSTEMS
(2024)