Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Cubic problems"”.

  1. Convex relaxations for cubic polynomial problems

    This dissertation addresses optimization of cubic polynomial problems. Heuristics for finding good quality feasible solutions and for improving on existing feasible solutions for a complex industrial problem, involving cubic and pooling constraints among other complicating constraints, have been …

    gatech Repository record for Convex relaxations for cubic polynomial problems (opens in a new tab)