The following pages link to Mohit Tawarmalani (Q227663):
Displayed 34 items.
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons (Q717135) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Convex extensions and envelopes of lower semi-continuous functions (Q1396213) (← links)
- Deriving convex hulls through lifting and projection (Q1646568) (← links)
- A polyhedral branch-and-cut approach to global optimization (Q1780949) (← links)
- Global optimization of 0-1 hyperbolic programs (Q1810871) (← links)
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications (Q1856388) (← links)
- Product disaggregation in global optimization and relaxations of rational programs (Q1863895) (← links)
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study (Q1881050) (← links)
- A finite branch-and-bound algorithm for two-stage stochastic integer programs (Q1881566) (← links)
- Explicit convex and concave envelopes through polyhedral subdivisions (Q1949256) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets (Q2248758) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- Convexification Techniques for Linear Complementarity Constraints (Q3009774) (← links)
- Allocating Objects in a Network of Caches: Centralized and Decentralized Analyses (Q3117773) (← links)
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs (Q3396382) (← links)
- (Q4788630) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- Multi-period maintenance scheduling of tree networks with minimum flow disruption (Q5198690) (← links)
- Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction (Q5348475) (← links)
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis (Q5870347) (← links)
- Semidefinite relaxations of fractional programs via novel convexification techniques (Q5954663) (← links)
- Convexification of Permutation-Invariant Sets and an Application to Sparse PCA (Q6326648) (← links)
- Advances in MINLP to Identify Energy-efficient Distillation Configurations (Q6352038) (← links)
- Optimal Design of Membrane Cascades for Gaseous and Liquid Mixtures via MINLP (Q6360272) (← links)
- Extracting structure from functional expressions for continuous and discrete relaxations of MINLP (Q6398126) (← links)
- MIP Relaxations in Factorable Programming (Q6454658) (← links)
- Convexification Techniques for Fractional Programs (Q6454909) (← links)