Pages that link to "Item:Q3847854"
From MaRDI portal
The following pages link to L’algebre de Boole et ses applications en recherche operationnelle (Q3847854):
Displaying 50 items.
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- A computational study for bilevel quadratic programs using semidefinite relaxations (Q323274) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Combinatorial optimization with one quadratic term: spanning trees and forests (Q406320) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Chance constrained \(0-1\) quadratic programs using copulas (Q499685) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
- How to select a small set of diverse solutions to mixed integer programming problems (Q833594) (← links)
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Discrete function expansions in integer powers (Q1136230) (← links)
- A decision model for interdependent information system project selection (Q1266704) (← links)
- Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays (Q1631647) (← links)
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach (Q1652097) (← links)
- Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming (Q1652204) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- Compact linearization for binary quadratic problems subject to assignment constraints (Q1728408) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Complete mixed integer linear programming formulations for modularity density based clustering (Q1751238) (← links)
- Improved compact formulations for a wide class of graph partitioning problems in sparse graphs (Q1751240) (← links)
- Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
- New solution approaches for the maximum-reliability stochastic network interdiction problem (Q1989731) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- Optimizing subscriber migrations for a telecommunication operator in uncertain context (Q2076939) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- Statistical quality assessment of Ising-based annealer outputs (Q2101593) (← links)
- Modified modularity density maximization and density ratio heuristic (Q2108173) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization (Q2164692) (← links)
- Product assortment and space allocation strategies to attract loyal and non-loyal customers (Q2184066) (← links)
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (Q2193002) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation (Q2274853) (← links)
- Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic (Q2288876) (← links)
- Convex hull representations of special monomials of binary variables (Q2311191) (← links)
- A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices (Q2516354) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks (Q2840686) (← links)
- (Q2861559) (← links)
- Nonlinear 0–1 programming: I. Linearization techniques (Q3216430) (← links)
