Solving the maximum duo-preservation string mapping problem with linear programming

Chen, Wenbin; Chen, Zhengzhang; Samatova, Nagiza F.; Peng, Lingxi; Wang, Jianxiong; Tang, Maobin

doi:10.1016/j.tcs.2014.02.017

Title: Solving the maximum duo-preservation string mapping problem with linear programming

Full Record
Other Related Research

Authors:: Chen, Wenbin; Chen, Zhengzhang; Samatova, Nagiza F.; Peng, Lingxi; Wang, Jianxiong; Tang, Maobin

Publication Date:: Tue Apr 01 00:00:00 EDT 2014

Sponsoring Org.:: USDOE

OSTI Identifier:: 1433386

Resource Type:: Published Article

Journal Name:: Theoretical Computer Science

Additional Journal Information:: Journal Name: Theoretical Computer Science Journal Volume: 530 Journal Issue: C; Journal ID: ISSN 0304-3975

Publisher:: Elsevier

Country of Publication:: Netherlands

Language:: English

Citation Formats


                    Chen, Wenbin, Chen, Zhengzhang, Samatova, Nagiza F., Peng, Lingxi, Wang, Jianxiong, and Tang, Maobin. Solving the maximum duo-preservation string mapping problem with linear programming.  Netherlands: N. p., 2014. 
Web.  doi:10.1016/j.tcs.2014.02.017.

Copy to clipboard


                    Chen, Wenbin, Chen, Zhengzhang, Samatova, Nagiza F., Peng, Lingxi, Wang, Jianxiong, & Tang, Maobin. Solving the maximum duo-preservation string mapping problem with linear programming.  Netherlands.  https://doi.org/10.1016/j.tcs.2014.02.017

Copy to clipboard


                    Chen, Wenbin, Chen, Zhengzhang, Samatova, Nagiza F., Peng, Lingxi, Wang, Jianxiong, and Tang, Maobin. Tue .  
"Solving the maximum duo-preservation string mapping problem with linear programming".  Netherlands.  https://doi.org/10.1016/j.tcs.2014.02.017.

Copy to clipboard


                    
@article{osti_1433386,

  title        = {Solving the maximum duo-preservation string mapping problem with linear programming},

  author       = {Chen, Wenbin and Chen, Zhengzhang and Samatova, Nagiza F. and Peng, Lingxi and Wang, Jianxiong and Tang, Maobin},

  abstractNote = {},

  doi          = {10.1016/j.tcs.2014.02.017},

  journal      = {Theoretical Computer Science},

  number       = C,

  volume       = 530,

  place        = {Netherlands},

  year         = {Tue Apr 01 00:00:00 EDT 2014},

  month        = {Tue Apr 01 00:00:00 EDT 2014}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Publisher's Version of Record
https://doi.org/10.1016/j.tcs.2014.02.017

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 18 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

A METHOD FOR SOLVING INTEGER LINEAR PROGRAMMING PROBLEMS BY THE USE OF GENERATING FUNCTIONS

Technical Report Thurber, J K
A penalty function-linear programming method for solving power system constrained economic operation problems

Journal Article Mota-Palomino, R ; Quintana, V H - IEEE Trans. Power Appar. Syst.; (United States)

The use of a non-conventional linear programming technique, involving a piecewise differentiable penalty function minimization, is presented in this paper in connection with power system Constrained Economic Dispatch (CED) problems. The theory behind the proposed solution technique is outlined, and the formulation of the CED is described. Some typical problems are solved on standard test power systems, and their results compared to other solution techniques. The main characteristics of the implemented algorithm are also discussed.
https://doi.org/10.1109/TPAS.1984.318478
Solving the Mixed Integer Non-linear Programming Problem of Unit Commitment.

Conference Castillo, Andrea R ; Laird, Carl Damon ; Watson, Jean-Paul

Abstract not provided.
Full Text Available
ALGORITHM FOR SOLVING INTEGER LINEAR PROGRAMMING PROBLEMS.

Technical Report Cooper, L.
https://doi.org/10.2172/4138524

Full Text Available
Tuning successive linear programming to solve AC optimal power flow problem for large networks

Journal Article Sadat, Sayed Abdullah ; Sahraei-Ardakani, Mostafa - International Journal of Electrical Power and Energy Systems

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in themore »« less
https://doi.org/10.1016/j.ijepes.2021.107807

Full Text Available

Similar Records