The following pages link to Wen-Xun Xing (Q1716971):
Displaying 50 items.
- (Q344789) (redirect page) (← links)
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- A conic approximation method for the 0-1 quadratic knapsack problem (Q380482) (← links)
- Computable representation of the cone of nonnegative quadratic forms over a general second-order cone and its application to completely positive programming (Q380506) (← links)
- On constraint qualifications: motivation, design and inter-relations (Q380531) (← links)
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- A canonical dual approach for solving linearly constrained quadratic programs (Q439448) (← links)
- (Q489093) (redirect page) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems (Q620017) (← links)
- Two-person knapsack game (Q620022) (← links)
- Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
- No-wait flexible flowshop scheduling with no-idle machines (Q813967) (← links)
- On-line service scheduling (Q835637) (← links)
- Performance of service policies in a specialized service system with parallel servers (Q940910) (← links)
- Global extremal conditions for multi-integer quadratic programming (Q1008793) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- Global optimization for a class of fractional programming problems (Q1037364) (← links)
- Parallel machine scheduling with splitting jobs (Q1570839) (← links)
- A bin packing problem with over-sized items (Q1612008) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines (Q1767900) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs (Q2030501) (← links)
- Fast computation of global solutions to the single-period unit commitment problem (Q2082175) (← links)
- Robust sensitivity analysis for linear programming with ellipsoidal perturbation (Q2190327) (← links)
- Worst-case analysis for on-line service policies (Q2268767) (← links)
- Two-group knapsack game (Q2268867) (← links)
- A gradient descent based algorithm for \(\ell_p\) minimization (Q2286916) (← links)
- Recovering optimal solutions via SOC-SDP relaxation of trust region subproblem with nonintersecting linear constraints (Q2315597) (← links)
- Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme (Q2355798) (← links)
- A-shaped bin packing: Worst case analysis via simulation (Q2386612) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Double well potential function and its optimization in the \(N\)-dimensional real space. I (Q2397572) (← links)
- Double well potential function and its optimization in the \(N\)-dimensional real space. II (Q2397573) (← links)
- Quadratic optimization over one first-order cone (Q2438413) (← links)
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities (Q2463794) (← links)
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem (Q2687676) (← links)
- Global optimization for non-convex programs via convex proximal point method (Q2691402) (← links)
- (Q2928413) (← links)
- (Q2928420) (← links)
- On the global optimality of generalized trust region subproblems (Q3066926) (← links)
- (Q3132650) (← links)
- (Q3148108) (← links)
- Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375) (← links)
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems (Q3225239) (← links)
- (Q3481525) (← links)
- (Q4528340) (← links)
- (Q4944735) (← links)
