Pages that link to "Item:Q2770136"
From MaRDI portal
The following pages link to Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems (Q2770136):
Displayed 46 items.
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- Optimization models for a single-plant district cooling system (Q320055) (← links)
- A two-level location-allocation problem in designing local access fiber optic networks (Q337111) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
- Rank bounds for a hierarchy of Lovász and Schrijver (Q498445) (← links)
- RLT: A unified approach for discrete and continuous nonconvex optimization (Q537611) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints (Q817207) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Interleaving two-phased jobs on a single machine (Q1019298) (← links)
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998) (← links)
- An effective linear approximation method for separable programming problems (Q1036545) (← links)
- The impact of distribution system characteristics on computational tractability (Q1042484) (← links)
- Foundation-penalty cuts for mixed-integer programs. (Q1413909) (← links)
- An efficient linearization approach for mixed-integer problems (Q1572989) (← links)
- A linearization method for mixed 0--1 polynomial programs (Q1577382) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- Robust multicriteria risk-averse stochastic programming models (Q1698287) (← links)
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions (Q1753550) (← links)
- A bilevel fixed charge location model for facilities under imminent attack (Q1762124) (← links)
- Exact interdiction models and algorithms for disconnecting networks via node deletions (Q1926497) (← links)
- A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
- Convex hull representation of the deterministic bipartite network interdiction problem (Q2248756) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- Two-stage stochastic hierarchical multiple risk problems: Models and algorithms (Q2390998) (← links)
- A multi-commodity flow formulation for the generalized pooling problem (Q2392115) (← links)
- Strong formulations for the pooling problem (Q2392127) (← links)
- Linear forms of nonlinear expressions: new insights on old ideas (Q2457269) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints (Q2576448) (← links)
- A matheuristic for the robust integrated airline fleet assignment, aircraft routing, and crew pairing problem (Q2669651) (← links)
- A conditional-logic interpretation for Miller-Tucker-Zemlin inequalities and extensions (Q2688908) (← links)
- Enhanced Models for a Mixed Arrival-Departure Aircraft Sequencing Problem (Q2940539) (← links)
- Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem (Q3406118) (← links)
- Discrete equal-capacityp-median problem (Q4949164) (← links)
- Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics (Q5085987) (← 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)
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions (Q5945383) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)