Results 271 to 280 of about 904,011 (327)
Some of the next articles are maybe not open access.
Distributed Cutting Plane Method via Sample Point Consensus
IEEE Transactions on Automatic ControlThis paper considers a general setup for the constrained convex optimisation problem over jointly-fully connected time-varying networks. We propose a novel cutting plane-based method that embeds a proximity-based consensus scheme for solving this (potentially non-smooth) optimisation problem.
Tianyi Zhong, David Angeli
openaire +2 more sources
A cutting plane method for knapsack polytope
Journal of Computer and Systems Sciences International, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A cutting plane method for bilevel linear programming with interval coefficients
Annals of Operations Research, 2014Aihong Ren, Yuping Wang
semanticscholar +1 more source
Unimodularity and Network Flows. Cutting-Plane Methods
1991At the beginning of this chapter, we show that the assumption of the integrality of data (Section 1.1) has a deep theoretical meaning. Next, in Sections 3.2–3.4 we consider problems in which requirements of integrality are redundant. By solving these problems by the simplex method we find an integer optimal solution. If integrality requirements are not
openaire +1 more source
The Subgradient Simplex Cutting Plane Method for Extended Locational Marginal Prices
IEEE Transactions on Power Systems, 2013Congcong Wang +4 more
semanticscholar +1 more source
A cutting plane method for solving harvest scheduling models with area restrictions
European Journal of Operational Research, 2013Nóra Könnyü, Sándor F. Tóth
semanticscholar +1 more source
Implementing the simplex method as a cutting-plane method, with a view to regularization
Computational optimization and applications, 2013Csaba I. Fábián +2 more
semanticscholar +1 more source