The following pages link to Miguel F. Anjos (Q263183):
Displayed 50 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- A semidefinite optimization-based approach for global optimization of multi-row facility layout (Q319523) (← links)
- Optimal design of bilateral contracts for energy procurement (Q319838) (← links)
- An improved two-stage optimization-based framework for unequal-areas facility layout (Q331972) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
- Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240) (← links)
- A nonlinear optimization methodology for VLSI fixed-outline floorplanning (Q1016045) (← links)
- An attractor-repeller approach to floorplanning (Q1396914) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Geometry of semidefinite Max-Cut relaxations via matrix ranks (Q1610658) (← links)
- Announcement: Howard Rosenbrock Prize 2016 (Q1642962) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- Exact separation of \(k\)-projection polytope constraints (Q1695086) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- An improved semidefinite programming relaxation for the satisfiability problem (Q1774165) (← links)
- Optimal pricing policies for perishable products (Q1779553) (← links)
- Mathematical optimization approach for facility layout on several rows (Q1996730) (← links)
- An RLT approach for solving the binary-constrained mixed linear complementarity problem (Q2002841) (← links)
- Accelerating Benders decomposition for short-term hydropower maintenance scheduling (Q2028814) (← links)
- Design and implementation of a modular interior-point solver for linear optimization (Q2062319) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel (Q2183333) (← links)
- Product-closing approximation for ranking-based choice network revenue management (Q2189895) (← links)
- Complexity of near-optimal robust versions of multilevel optimization problems (Q2230787) (← links)
- Facility layout. Mathematical optimization techniques and engineering (Q2246149) (← links)
- Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems (Q2250079) (← links)
- A convex optimisation framework for the unequal-areas facility layout problem (Q2275810) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Second-order cone optimization formulations for service system design problems with congestion (Q2325238) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- Modified orbital branching for structured symmetry with an application to unit commitment (Q2340280) (← links)
- Announcement: Inaugural Howard Rosenbrock Prize (Q2357941) (← links)
- Announcement: Howard Rosenbrock Prize 2015 (Q2358059) (← links)
- On semidefinite programming relaxations for the satisfiability problem (Q2386349) (← links)
- Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem (Q2391873) (← links)
- Semidefinite resolution and exactness of semidefinite relaxations for satisfiability (Q2446872) (← links)
- A semidefinite optimization approach for the single-row layout problem with unequal dimensions (Q2568330) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- (Q2768060) (← links)
- Introduction to Semidefinite, Conic and Polynomial Optimization (Q2802517) (← links)
- Global Approaches for Facility Layout and VLSI Floorplanning (Q2802548) (← links)
- Solution Approaches for the Double-Row Equidistant Facility Layout Problem (Q2806884) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization (Q2883644) (← links)
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems (Q2885494) (← links)
- A New Mathematical-Programming Framework for Facility-Layout Design (Q2892276) (← links)