A Selection Problem of Shared Fixed Costs and Network Flows

Cited in

(73)

Submodular maximization and its generalization through an intersection cut lens
Dynamic evolution of economically preferred facilities
Some thoughts on combinatorial optimisation
Structural and algorithmic properties for parametric minimum cuts
Roof duality, complementation and persistency in quadratic 0–1 optimization
On exact solution approaches for bilevel quadratic 0-1 knapsack problem
A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
Roof duality for polynomial 0–1 optimization
Strong unimodularity for matrices and hypergraphs
A hierarchical approach for metal parts fabrication
Polynomial time algorithm for an optimal stable assignment with multiple partners
On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
The quadratic knapsack problem with setup
The unconstrained binary quadratic programming problem: a survey
Pseudo-Boolean optimization
A fast and effective breakpoints heuristic algorithm for the quadratic knapsack problem
Valid inequalities and separation for uncapacitated fixed charge networks
Introduction to QUBO
Unconstrained quadratic bivalent programming problem
Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
Planning for conjunctive goals
Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
An algorithm for indefinite integer quadratic programming
Best reduction of the quadratic semi-assignment problem
Rounding algorithms for covering problems
The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
On project scheduling with irregular starting time costs
The expressive power of binary submodular functions
Differential approximation schemes for half-product related functions and their scheduling applications
Approximability issues for unconstrained and constrained maximization of half-product related functions
Clique-connecting forest and stable set polytopes
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
The Boolean quadratic polytope: Some characteristics, facets and relatives
Recognition of a class of unimodular functions
On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
Lagrangian heuristics for the quadratic knapsack problem
Boolean polynomials and set functions
Unconstrained 0-1 optimization and Lagrangean relaxation
The Steiner tree polytope and related polyhedra
Global optimality conditions and optimization methods for quadratic knapsack problems
A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems
Using separation algorithms to generate mixed integer model reformulations
Selecting a discrete portfolio
Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
Modelling and solving an FMS part selection problem
The quadratic knapsack problem -- a survey
The directed profitable location rural postman problem
The Expressive Power of Binary Submodular Functions
Maximal closure on a graph with resource constraints
Autarkies and Persistencies for QUBO
A polynomial case of convex integer quadratic programming problems with box integer constraints
Unimodular functions
A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
Facility siting and integer-friendly programming
Cliques and clustering: A combinatorial approach
Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
A semantic relatedness preserved subset extraction method for language corpora based on pseudo-Boolean optimization
The quadratic minimum spanning tree problem: lower bounds via extended formulations
Pareto robust optimization on Euclidean vector spaces
Finding a maximum-weight convex set in a chordal graph
Efficient minimization of higher order submodular functions using monotonic Boolean functions
Classes of submodular constraints expressible by graph cuts
Using critical sets to solve the maximum independent set problem
The quadratic knapsack problem
A network approach for specially structured linear programs arising in 0-1 quadratic optimization
Approximation algorithms for discrete polynomial optimization
The allocation of shared fixed costs
The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions

This page was built for publication: A Selection Problem of Shared Fixed Costs and Network Flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5603745)