Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
From MaRDI portal
Publication:1749453
DOI10.1007/s10107-018-1242-zzbMath1390.90488OpenAlexW2791249516MaRDI QIDQ1749453
Yishui Wang, Ding-Zhu Du, Zaixin Lu, Zhao Zhang, Da-Chuan Xu, Panos M. Pardalos, Chen-Chen Wu
Publication date: 16 May 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-018-1242-z
Related Items (4)
Parametric monotone function maximization with matroid constraints ⋮ Fast algorithms for maximizing monotone nonsubmodular functions ⋮ Fast algorithms for maximizing monotone nonsubmodular functions ⋮ Set function optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On local search in d.c. optimization problems
- Exact penalty and error bounds in DC programming
- A framework of discrete DC programming by discrete convex analysis
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Properties of two DC algorithms in quadratic programming
- Approximation algorithms for scheduling unrelated parallel machines
- Increasing the rooted connectivity of a digraph by one
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A 1.488 approximation algorithm for the uncapacitated facility location problem
- The Design of Approximation Algorithms
- Generating Minimal k-Vertex Connected Spanning Subgraphs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Discrete Convex Analysis
- Continuous Relaxation for Discrete DC Programming
- Steiner Tree Approximation via Iterative Randomized Rounding
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
