Optimal Interdiction of Illegal Network Flow
Authors: Qingyu Guo, Bo An, Yair Zick, Chunyan Miao
IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | 6 Experimental Evaluation We evaluate the performance of our approach through extensive experiments. We use CPLEX (version 12.6) to solve linear programs and KNITRO (version 9.0.0) to solve nonlinear programs. All computations were performed on a 64-bit PC with 16 GB RAM and a quad-core 3.4 GHz processor. All values are averaged over 40 instances unless otherwise specified. All random planar graphs are generated by the Waxman geographical model (WG) suitable for modeling highway networks [Waxman, 1988]. |
| Researcher Affiliation | Academia | 1Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly, NTU, Singapore 2School of Computer Science and Engineering, Nanyang Technological University, Singapore 3School of Computer Science, Carnegie-Mellon University, USA |
| Pseudocode | Yes | Algorithm 1: CCG Algorithm for NFIG; Algorithm 2: Greedy Algorithm for Column Generation; Algorithm 3: VNS for Con G; Algorithm 4: Local Search (p) |
| Open Source Code | No | The paper mentions an 'Online Appendix' available at a given URL for explanations and proofs, but does not state that the source code for their methodology is provided there or at any other location. |
| Open Datasets | No | The paper states, 'All random planar graphs are generated by the Waxman geographical model (WG) suitable for modeling highway networks [Waxman, 1988].' and 'We also conduct experiments on two sectors in Southern Border Patrol: Laredo and San Diego sectors. Please see Section C of Online Appendix1 for details of these sectors.' It does not provide concrete access information (link, DOI, or specific repository name) for these datasets. |
| Dataset Splits | No | The paper does not explicitly provide training/test/validation dataset splits, specific percentages, or sample counts. |
| Hardware Specification | Yes | All computations were performed on a 64-bit PC with 16 GB RAM and a quad-core 3.4 GHz processor. |
| Software Dependencies | Yes | We use CPLEX (version 12.6) to solve linear programs and KNITRO (version 9.0.0) to solve nonlinear programs. |
| Experiment Setup | Yes | The instances are parameterized as follows: the number of inspection stations |I| = b (|V | + |E|)c and the number of resources k = bβ(|V | + |E|)c, where and β are tunable parameters. All inspection stations are randomly placed on the graph. The edge capacity ce is randomly chosen in [0, 10], and inspection probability i [0.4, 0.6]. The l and cmax are set as 4 and |V | respectively in VNS. |