Code and Data Repository for A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems

This repository contains the software and data used in the paper A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems. The primary goal of this work is to propose and evaluate a novel approach to solving continuous network design problems (CNDP), specifically through a penalized sequential convex programming method.

Authors

Publication Details

Journal
INFORMS journal on computing
Published
2025-03-27
DOI
https://doi.org/10.1287/ijoc.2024.0737.cd
Citations
1
Primary Topic
VLSI and FPGA Design Techniques
Type
article
Field-Weighted Citation Impact
0.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Code and Data Repository for A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems

Haian Yin, Lei Guo, Jin Zhang
1 citations
INFORMS journal on computing
VLSI and FPGA Design Techniques
0.73
article

Code and Data Repository for A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems

Haian Yin, Lei Guo, Jin Zhang
article en
1 citations

Abstract

This repository contains the software and data used in the paper A Penalized Sequential Convex Programming Approach for Continuous Network Design Problems. The primary goal of this work is to propose and evaluate a novel approach to solving continuous network design problems (CNDP), specifically through a penalized sequential convex programming method.

INFORMS journal on computing
Openalex Percentile: Top 30%
VLSI and FPGA Design Techniques
0.73
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.