The DOI matches its Crossref record.
Partitioning procedures for solving mixed-variables programming problems
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Generalized Benders decomposition
Geoffrion, A. M. (1972) · Journal of Optimization Theory and Applications · doi:10.1007/bf00934810 · Cited by 2,478
The vehicle routing problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90192-c · Cited by 1,749
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Duran, M. A., & Grossmann, I. E. (1986) · Mathematical Programming · doi:10.1007/bf02592064 · Cited by 1,447
Multi-stage stochastic optimization applied to energy planning
Pereira, M. V. F., & Pinto, L. M. V. G. (1991) · Mathematical Programming · doi:10.1007/bf01582895 · Cited by 1,361
L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
Van Slyke, R. M., & Wets, R. (1969) · SIAM Journal on Applied Mathematics · doi:10.1137/0117061 · Cited by 1,281
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Multidisciplinary Design Optimization: A Survey of Architectures
Martins, J. R. R. A., & Lambe, A. B. (2013) · AIAA Journal · doi:10.2514/1.j051895 · Cited by 1,111
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
A generalized assignment heuristic for vehicle routing
Fisher, M. L., & Jaikumar, R. (1981) · Networks · doi:10.1002/net.3230110205 · Cited by 1,076
Multicommodity Distribution System Design by Benders Decomposition * † ‡
Geoffrion, A. M., & Graves§, G. W. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-6810-4_4 · Cited by 978
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
SVM-RFE: selection and visualization of the most relevant features through non-linear kernels
Sanz, H., Valim, C., Vegas, E., Oller, J. M., & Reverter, F. (2018) · BMC Bioinformatics · doi:10.1186/s12859-018-2451-4 · Cited by 804
The integer L-shaped method for stochastic integer programs with complete recourse
Laporte, G., & Louveaux, F. V. (1993) · Operations Research Letters · doi:10.1016/0167-6377(93)90002-x · Cited by 778
Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
Magnanti, T. L., & Wong, R. T. (1981) · Operations Research · doi:10.1287/opre.29.3.464 · Cited by 731
Biegler, L. T., & Grossmann, I. E. (2004) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2003.11.003 · Cited by 593
Convex Models of Distribution System Reconfiguration
Taylor, J. A., & Hover, F. S. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2184307 · Cited by 444
An optimization framework for the development of efficient one-way car-sharing systems
Boyacı, B., Zografos, K. G., & Geroliminis, N. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2014.07.020 · Cited by 441
Price-Based Unit Commitment: A Case of Lagrangian Relaxation Versus Mixed Integer Programming
Li, T., & Shahidehpour, M. (2005) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2005.857391 · Cited by 427
SELECT—a formal system for testing and debugging programs by symbolic execution
Boyer, R. S., Elspas, B., & Levitt, K. N. (1975) · ACM SIGPLAN Notices · doi:10.1145/390016.808445 · Cited by 390
A Sequential Bounding Approach for Optimal Appointment Scheduling
Denton, B., & Gupta, D. (2003) · IIE Transactions · doi:10.1080/07408170304395 · Cited by 340
Pishvaee, M. S., Razmi, J., & Torabi, S. A. (2014) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2014.04.001 · Cited by 298
Smart microgrid energy and reserve scheduling with demand response using stochastic optimization
Zakariazadeh, A., Jadid, S., & Siano, P. (2014) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2014.06.037 · Cited by 296
An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
Laporte, G., Louveaux, F. V., & van Hamme, L. (2002) · Operations Research · doi:10.1287/opre.50.3.415.7751 · Cited by 289
Monte Carlo sampling-based methods for stochastic optimization
Homem-de-Mello, T., & Bayraksan, G. (2014) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2014.05.001 · Cited by 283
Ajagekar, A., Humble, T., & You, F. (2020) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.106630 · Cited by 191
“The proposed hybrid QC-MIQP stepwise decomposition method is based on Bender’s decomposition [65], by considering the above manufacturing cell formation problem given in Eq.”
MethodOn the Values of Vehicle-to-Grid Electricity Selling in Electric Vehicle Sharing
Zhang, Y., Lu, M., & Shen, S. (2020) · Manufacturing & Service Operations Management · doi:10.1287/msom.2019.0855 · Cited by 78
Pippia, T., Sijs, J., & De Schutter, B. (2020) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2019.2945023 · Cited by 58
Rey, D., Almi’ani, K., & Nair, D. J. (2018) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2018.02.001 · Cited by 49
Metadata
- Authors
- Benders, J. F.
- Venue
- Numerische Mathematik
- Published
- 1962-12
- Volume
- 4
- Issue
- 1
- Pages
- 238-252
- ISSN
- 0029-599X (ISSN-L)
- 0945-3245
- OpenAlex
- W2044121814
- Cited by
- 3,855
- References
- 0
- FWCI
- 2.94
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.