• Home
  • Search
  • Multi-objective Integer Programming Approaches for Solving the Multi-criteria Test-suite Minimization Problem
  • Cite Icon15
  • https://doi.org/10.1145/3392031Copy DOI Icon

Multi-objective Integer Programming Approaches for Solving the Multi-criteria Test-suite Minimization Problem

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Test-suite minimization is one key technique for optimizing the software testing process. Due to the need to balance multiple factors, multi-criteria test-suite minimization (MCTSM) becomes a popular research topic in the recent decade. The MCTSM problem is typically modeled as integer linear programming (ILP) problem and solved with weighted-sum single objective approach. However, there is no existing approach that can generate sound (i.e., being Pareto-optimal) and complete (i.e., covering the entire Pareto front) Pareto-optimal solution set, to the knowledge of the authors. In this work, we first prove that the ILP formulation can accurately model the MCTSM problem and then propose the multi-objective integer programming (MOIP) approaches to solve it. We apply our MOIP approaches on three specific MCTSM problems and compare the results with those of the cutting-edge methods, namely, NonlinearFormulation_LinearSolver (NF_LS) and two Multi-Objective Evolutionary Algorithms (MOEAs). The results show that our MOIP approaches can always find sound and complete solutions on five subject programs, using similar or significantly less time than NF_LS and two MOEAs do. The current experimental results are quite promising, and our approaches have the potential to be applied for other similar search-based software engineering problems.

Similar Papers
  • Conference Article
  • Citations9

Reducing the complexity of ILP formulations for synthesis

  • Nov 22, 2002
  • A Mignotte +1
  • Research Article
  • Citations2

Guaranteed Protection in Survivable WDM Mesh Networks – New ILP Formulations for Link Protection and Path Protection

  • Dec 30, 2011
  • Journal of Telecommunications and Information Technology
  • Baibaswata Mohapatra +2
  • PDF
  • Research Article
  • Citations3

Least Squares Support Vector Machine for Ranking Solutions of Multi-Objective Water Resources Allocation Optimization Models

  • Apr 05, 2017
  • Water
  • Weilin Liu +2
  • Conference Article
  • Citations3

Multi-Objective vs. Single-Objective Evolutionary Algorithms for hybrid mobile robot optimization

  • Dec 01, 2014
  • S H Lim +1
  • Conference Article

A Polynomial Time Routing Algorithm for Meda Biochips Based on Dijkstra's Algorithm

  • Jan 03, 2026
  • Issei Nakamura +3
  • Research Article
  • Citations496

An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems

  • Apr 23, 2013
  • Applied Mathematics and Computation
  • George Mavrotas +1
  • Research Article
  • Citations10

Heuristic Approach to Distributed Server Allocation with Preventive Start-Time Optimization against Server Failure

  • Jan 31, 2021
  • IEICE Transactions on Communications
  • Souhei Yanase +4
  • Conference Article
  • Citations8

Memory minimization for tensor contractions using integer linear programming

  • Jan 01, 2006
  • A Allam +3
  • Conference Article
  • Citations3

ILP-based Synthesis for Sample Preparation Applications on Digital Microfluidic Biochips

  • Jan 01, 2016
  • Abhimanyu Yadav +3
  • Book Chapter
  • Citations4

An Adaptive Control for Surrogate Assisted Multi-objective Evolutionary Algorithms

  • Dec 15, 2020
  • Duc Dinh Nguyen +1
  • Conference Article
  • Citations1

Scheduling using mixed arithmetic: an ILP formulation

  • Jan 01, 1997
  • A Mignotte +1
  • Research Article
  • Citations9

Multicast wavelength assignment with sparse wavelength converters to maximize the network capacity using ILP formulation in WDM mesh networks

  • Sep 09, 2006
  • Photonic Network Communications
  • I‐Shyan Hwang +2
  • Conference Article
  • Citations4

Mocarabe: High-Performance Time-Multiplexed Overlays for FPGAs

  • May 01, 2021
  • Frederick Tombs +2
  • Research Article

On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics

  • Oct 08, 2019
  • RAIRO - Operations Research
  • Daniel Morais Dos Reis +3
  • Research Article
  • Citations518

Generalized Integer Linear Programming Formulation for Optimal PMU Placement

  • Aug 01, 2008
  • IEEE Transactions on Power Systems
  • B Gou
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.