Results 241 to 250 of about 22,543 (264)

Valid Inequality Based Lower Bounds for WCSP

2007
Most of efficient WCSP solving methods are based on arc consistency notion used to transform a WCSP into an equivalent one easier to solve. There are several forms of arc consistency : AC* [9], DAC* [8], FDAC* [8], EDAC* [4]. Recently, an Optimal Soft Arc Consistency (OSAC) was proposed [2].
Mohand Ou Idir Khemmoudj, Hachemi Bennaceur   +1 more
openaire   +1 more source

Valid Inequalities for Separable Concave Constraints with Indicator Variables

Mathematical Programming, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cong Han Lim, Jeff T. Linderoth, James R. Luedtke   +2 more
openaire   +1 more source

Lot-Sizing with Constant Batches: Formulation and Valid Inequalities

Mathematics of Operations Research, 1993
We consider the classical lot-sizing problem with constant production capacities (LCC) and a variant in which the capacity in each period is an integer multiple of some basic batch size (LCB). We first show that the classical dynamic program for LCC simplifies for LCB leading to an O(n2 min{n, C}) algorithm (where n is the number of periods and C the
Yves Pochet, Laurence A. Wolsey
openaire   +2 more sources

On the validity of the Cauchy–Schwarz inequality for the bracket map [PDF]

Glasnik Matematicki
Due to its properties, the bracket map associated with a dual integrable unitary representation of a locally compact group can be viewed as a certain operator-valued inner product; however, in the non-commutative setting, the Cauchy–Schwarz property for bracket is no longer present in its full strength.
openaire   +2 more sources

Bilevel Programming and Maximally Violated Valid Inequalities. [PDF]

, 2009
In recent years, branch-and-cut algorithms have become firmly established as the most effective method for solving generic mixed integer linear programs (MIPs). Methods for automatically generating inequalities valid for the convex hull of solutions to such MIPs are a critical element of branch-and-cut.
LODI, ANDREA, T. K. Ralphs
openaire   +1 more source

A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation

Operations Research, 2022
Fengqiao Luo, Jeffrey Larson
exaly  

Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm

Operations Research, 2021
Albert Harm Schrotenboer, Kees Jan Roodbergen, Michiel A J Uit Het Broek   +2 more
exaly  

The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability

Operations Research Letters, 2010
Nelson Uhan, Özlem Ergun
exaly  

New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem

Electronic Notes in Discrete Mathematics, 2018
Guido Perboli, Edoardo Fadda, Roberto Tadei   +2 more
exaly  

On the validity of a global thermodynamic inequality

Journal of Statistical Physics, 1972
openaire   +1 more source