L’algebre de Boole et ses applications en recherche operationnelle
From MaRDI portal
Publication:3847854
DOI10.1007/BF03006558zbMath0109.38201MaRDI QIDQ3847854
Publication date: 1960
Published in: Trabajos de Estadistica (Search for Journal in Brave)
Related Items
Dantzig-Wolfe reformulations for binary quadratic problems, How to select a small set of diverse solutions to mixed integer programming problems, Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays, A model for clustering data from heterogeneous dissimilarities, A computational study for bilevel quadratic programs using semidefinite relaxations, Stochastic graph partitioning: quadratic versus SOCP formulations, Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach, Maximizing the number of conflict-free aircraft using mixed-integer nonlinear programming, Simple odd \(\beta \)-cycle inequalities for binary polynomial optimization, A Branch-and-Bound Algorithm for Team Formation on Social Networks, The Boolean quadratic polytope: Some characteristics, facets and relatives, Strong valid inequalities for Boolean logical pattern generation, Nonlinear 0–1 programming: I. Linearization techniques, Product assortment and space allocation strategies to attract loyal and non-loyal customers, Discrete function expansions in integer powers, Inductive linearization for binary quadratic programs with linear constraints, Mathematical programming: Turing completeness and applications to software analysis, Combinatorial optimization with one quadratic term: spanning trees and forests, Optimizing the investments in mobile networks and subscriber migrations for a telecommunication operator, An integer linear optimization model to the compartmentalized knapsack problem, Optimal quadratic reformulations of fourth degree pseudo-Boolean functions, Shortest paths with exclusive-disjunction arc pairs conflicts, Efficient linear reformulations for binary polynomial optimization problems, On the complexity of binary polynomial optimization over acyclic hypergraphs, A polyhedral study of lifted multicuts, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme, Best second order bounds for two-terminal network reliability with dependent edge failures, Compact linearization for binary quadratic problems subject to assignment constraints, A network approach for specially structured linear programs arising in 0-1 quadratic optimization, Chance constrained \(0-1\) quadratic programs using copulas, Mixed-Integer Programming for Cycle Detection in Nonreversible Markov Processes, New solution approaches for the maximum-reliability stochastic network interdiction problem, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Berge-acyclic multilinear 0-1 optimization problems, Quadratic reformulations of nonlinear binary optimization problems, Norm bounds and underestimators for unconstrained polynomial integer minimization, A class of valid inequalities for multilinear 0-1 optimization problems, Complete mixed integer linear programming formulations for modularity density based clustering, Improved compact formulations for a wide class of graph partitioning problems in sparse graphs, RLT insights into lift-and-project closures, Pseudo-Boolean optimization, Unnamed Item, A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation, Algorithms and applications for a class of bilevel MILPs, \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation, Theoretical and computational study of several linearisation techniques for binary quadratic problems, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, A decision model for interdependent information system project selection, Convex hull representations of special monomials of binary variables, Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem, A Two Stage Stochastic Semidefinite Relaxation for wireless OFDMA Networks, Optimizing subscriber migrations for a telecommunication operator in uncertain context, Compact mixed-integer programming formulations in quadratic optimization, Application of pseudo-Boolean programming to the theory of graphs, Statistical quality assessment of Ising-based annealer outputs, Tight Cycle Relaxations for the Cut Polytope, Modified modularity density maximization and density ratio heuristic, Projection, lifting and extended formulation integer and combinatorial optimization, ``Miniaturized linearizations for quadratic 0/1 problems
Cites Work
