Pages that link to "Item:Q598587"
From MaRDI portal
The following pages link to A class of problems where dual bounds beat underestimation bounds (Q598587):
Displaying 11 items.
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- On the relation between concavity cuts and the surrogate dual for convex maximization problems (Q427376) (← links)
- Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints (Q813372) (← links)
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability (Q930342) (← links)
- Global optimization of disjunctive programs (Q1679482) (← links)
- Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
- Convergent upper bounds in global minimization with nonlinear equality constraints (Q2020617) (← links)
- Dual lower bounds for approximate degree and Markov-Bernstein inequalities (Q2347795) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- Tight Bounds for Double Coverage Against Weak Adversaries (Q2788990) (← links)
- A branch-and-bound algorithm for nonconvex Nash equilibrium problems (Q6622755) (← links)
