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 14 items.
- Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes (Q4643799) (← links)
- Tight Cycle Relaxations for the Cut Polytope (Q5020841) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- Application of pseudo-Boolean programming to the theory of graphs (Q5516545) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator (Q6087130) (← links)
- An integer linear optimization model to the compartmentalized knapsack problem (Q6088172) (← links)
- Shortest paths with exclusive-disjunction arc pairs conflicts (Q6164356) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- New optimization models for optimal classification trees (Q6551126) (← links)
- Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)
