Xiucui Guan

Orcid: 0000-0002-2653-1868

According to our database1, Xiucui Guan authored at least 28 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Inverse Vertex/Absolute Quickest 1-Center Location Problem on a Tree Under Weighted l<sub>1</sub> Norm.
J. Optim. Theory Appl., February, 2024

2023
The restricted inverse optimal value problem on shortest path under l<sub>1</sub> norm on trees.
J. Glob. Optim., May, 2023

Vertex quickest 1-center location problem on trees and its inverse problem under weighted l<sub>∞</sub> norm.
J. Glob. Optim., February, 2023

Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted l∞ norm.
J. Comput. Appl. Math., 2023

2022
Inverse max+sum spanning tree problem under weighted l<sub>∞ </sub> norm by modifying max-weight vector.
J. Glob. Optim., 2022

The sum of root-leaf distance interdiction problem by upgrading edges/nodes on trees.
J. Comb. Optim., 2022

2021
Maximum shortest path interdiction problem by upgrading edges on trees under hamming distance.
Optim. Lett., 2021

The lower bounded inverse optimal value problem on minimum spanning tree under unit l<sub>∞ </sub> norm.
J. Glob. Optim., 2021

Maximum shortest path interdiction problem by upgrading edges on trees under weighted l<sub>1</sub> norm.
J. Glob. Optim., 2021

Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance.
J. Comb. Optim., 2021

Scheduled service network design of long-haul freight transportation based on the segment subcontract.
Comput. Ind. Eng., 2021

The Critical Node Problem Based on Connectivity Index and Properties of Components on Trees.
Asia Pac. J. Oper. Res., 2021

2020
Inverse optimal value problem on minimum spanning tree under unit l<sub>∞ </sub> norm.
Optim. Lett., 2020

2018
Inverse max+sum spanning tree problem under weighted l<sub>1</sub> norm by modifying the sum-cost vector.
Optim. Lett., 2018

An Algorithm for Solving the Shortest Path Improvement Problem on Rooted Trees Under Unit Hamming Distance.
J. Optim. Theory Appl., 2018

2017
Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector.
J. Glob. Optim., 2017

2015
Inverse Max + Sum spanning tree problem by modifying the sum-cost vector under weighted l<sub>∞</sub> Norm.
J. Glob. Optim., 2015

2013
Algorithms for the Shortest Path Improvement Problems under Unit Hamming Distance.
J. Appl. Math., 2013

2012
Inverse 1-median problem on trees under weighted Hamming distance.
J. Glob. Optim., 2012

2010
Inverse 1-median Problem on Trees under Weighted <i>l</i><sub>∞</sub> Norm.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
A Class of Constrained Inverse Bottleneck Optimization Problems under Weighted Hamming Distance.
Proceedings of the Second International Joint Conference on Computational Sciences and Optimization, 2009

2007
Improving multicut in directed trees by upgrading nodes.
Eur. J. Oper. Res., 2007

Inverse constrained bottleneck problems under weighted l<sub>infinity</sub> norm.
Comput. Oper. Res., 2007

2006
A class of node based bottleneck improvement problems.
Eur. J. Oper. Res., 2006

Multi-objective Optimal Strategy for Individual Consumption-Investment with Fuzzy Coefficients.
Proceedings of the Intelligent Computing, 2006

Further Research on Node Based Bottleneck Improvement Problem for Multicut.
Proceedings of the Intelligent Computing, 2006

Inverse Bottleneck Optimization Problems on Networks.
Proceedings of the Algorithmic Aspects in Information and Management, 2006

2005
Inverse Constrained Bottleneck Problems on Networks.
Proceedings of the Computational Science and Its Applications, 2005


  Loading...