The following pages link to (Q5538300):
Displaying 50 items.
- \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
- Remarkable polyhedra related to set functions, games and capacities (Q301379) (← links)
- Multiobjective optimization for aircraft conflict resolution. A metaheuristic approach (Q320753) (← links)
- Hybrid column generation for large-size covering integer programs: application to transportation planning (Q336412) (← links)
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- New axiomatizations of the Shapley interaction index for bi-capacities (Q409735) (← links)
- The arity gap of order-preserving functions and extensions of pseudo-Boolean functions (Q412326) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Locally monotone Boolean and pseudo-Boolean functions (Q444430) (← links)
- Symmetric approximations of pseudo-Boolean functions with applications to influence indexes (Q449336) (← links)
- Influence and interaction indexes for pseudo-Boolean functions: a unified least squares approach (Q477327) (← links)
- Prominent classes of the most general subsumptive solutions of Boolean equations (Q507645) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- Measuring the interactions among variables of functions over the unit hypercube (Q534728) (← links)
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- A branch and bound method for multi-objective Boolean problems (Q593985) (← links)
- Towards an analysis of linguistic modelling (Q598823) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- Relations between threshold and \(k\)-interval Boolean functions (Q646713) (← links)
- Axiomatizations of quasi-Lovász extensions of pseudo-Boolean functions (Q657823) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Weighted Banzhaf power and interaction indexes through weighted approximations of games (Q713119) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- Using multiple reference levels in multi-criteria decision aid: the generalized-additive independence model and the Choquet integral approaches (Q723941) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Computational experience with an interior point algorithm on the satisfiability problem (Q753688) (← links)
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture (Q757239) (← links)
- Unconstrained quadratic bivalent programming problem (Q792219) (← links)
- The threshold order of a Boolean function (Q805595) (← links)
- The general Steiner problem in Boolean space and application (Q810871) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- How to select a small set of diverse solutions to mixed integer programming problems (Q833594) (← links)
- Interaction transform for bi-set functions over a finite set (Q855691) (← links)
- Modeling and integer programming techniques applied to propositional calculus (Q918954) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Tabu search-based metaheuristic algorithm for software system reliability problems (Q955616) (← links)
- Algebraic and topological closure conditions for classes of pseudo-Boolean functions (Q967323) (← links)
- Transforms of pseudo-Boolean random variables (Q968108) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Maximization of submodular functions: theory and enumeration algorithms (Q1027590) (← links)
- The interaction transform for functions on lattices (Q1043572) (← links)
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm (Q1044764) (← links)
- Unit integer quadratic binary programming (Q1053599) (← links)
- Unimodular functions (Q1079493) (← links)
- Strong unimodularity for matrices and hypergraphs (Q1104339) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- Aggregation of constraints in integer programming (Q1108194) (← links)
