Pages that link to "Item:Q2200081"
From MaRDI portal
The following pages link to Solving polyhedral d.c. optimization problems via concave minimization (Q2200081):
Displaying 9 items.
- On the problem of minimizing a difference of polyhedral convex functions under linear constraints (Q346824) (← links)
- The ABC of DC programming (Q829493) (← links)
- Concave programming and DH-point (Q1029682) (← links)
- Computing a global optimal solution to a design centering problem (Q1184340) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- Polyhedral annexation, dualization and dimension reduction technique in global optimization (Q1200635) (← links)
- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver (Q1679488) (← links)
- Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
- Concave Minimization Via Collapsing Polytopes (Q3770289) (← links)