The following pages link to Atamtürk, Alper (Q163008):
Displayed 50 items.
- Item:Q163008 (redirect page) (← links)
- A polyhedral study of production ramping (Q304233) (← links)
- Maximizing a class of submodular utility functions (Q543403) (← links)
- Lifting for conic mixed-integer programming (Q623366) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Integer-programming software systems (Q817202) (← links)
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times (Q833574) (← links)
- Conic mixed-integer rounding cuts (Q847842) (← links)
- An \(O(n^2)\) algorithm for lot sizing with inventory bounds and fixed costs (Q943783) (← links)
- Partition inequalities for capacitated survivable network design based on directed \(p\)-cycles (Q951116) (← links)
- Polymatroids and mean-risk minimization in discrete optimization (Q957370) (← links)
- Mingling: mixed-integer rounding with bounds (Q964180) (← links)
- Parallel machine match-up scheduling with manufacturing cost considerations (Q969751) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- On the facets of the mixed-integer knapsack polyhedron (Q1424283) (← links)
- On splittable and unsplittable flow capacitated network design arc-set polyhedra. (Q1611009) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables (Q1675255) (← links)
- Supermodular covering knapsack polytope (Q1751131) (← links)
- On capacitated network design cut-set polyhedra (Q1849499) (← links)
- A study of the lot-sizing polytope (Q1881043) (← links)
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems (Q1922639) (← links)
- Conflict graphs in solving integer programming problems (Q1969889) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
- A note on capacity models for network design (Q2417179) (← links)
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables (Q2423781) (← links)
- \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set (Q2429470) (← links)
- Strong formulations of robust mixed 0-1 programming (Q2502200) (← links)
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables (Q2670502) (← links)
- A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems (Q2917632) (← links)
- Aircraft Rescheduling with Cruise Speed Control (Q2931703) (← links)
- Capacity Acquisition, Subcontracting, and Lot Sizing (Q3114717) (← links)
- The Flow Set with Partial Order (Q3168991) (← links)
- Successive Quadratic Upper-Bounding for Discrete Mean-Risk Minimization and Network Interdiction (Q3386769) (← links)
- Two-Stage Robust Network Flow and Design Under Demand Uncertainty (Q3392104) (← links)
- Network design arc set with variable upper bounds (Q3593365) (← links)
- Sequence Independent Lifting for Mixed-Integer Programming (Q3637441) (← links)
- (Q4263702) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems (Q4642417) (← links)
- (Q4667214) (← links)
- Technical Note—A Conic Integer Optimization Approach to the Constrained Assortment Problem Under the Mixed Multinomial Logit Model (Q4971390) (← links)
- (Q4998944) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Network design with probabilistic capacities (Q5228504) (← links)
- Maximizing a Class of Utility Functions Over the Vertices of a Polytope (Q5278276) (← links)
- Lot Sizing with Inventory Bounds and Fixed Costs: Polyhedral Study and Computation (Q5322130) (← links)
- Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem (Q5355207) (← links)