default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBismark Singh
Person information
- affiliation: University of Southampton, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2026
[j16]Christian Schmitt, Bismark Singh
:
An analytical lower bound for a class of minimizing quadratic integer optimization problems. Discret. Appl. Math. 380: 672-683 (2026)- [j15]Malena Schmidt, Bismark Singh:
The Balanced Facility Location Problem: Complexity and Heuristics. INFORMS J. Comput. 38(1): 16-38 (2026) - 2025
- [j14]Nikila Suresh, Bismark Singh:
Optimizing a Heritage Railway Provider's Volunteer Workforce Allocation: The Case of Swanage Railways. INFORMS J. Appl. Anal. 55(4): 375-382 (2025) - [j13]Bismark Singh:
Puzzle - A Mathematical Programming Approach for Mongolia's "The Four Strongest" Puzzle. INFORMS Trans. Educ. 25(3): 265-269 (2025) - 2024
- [j12]Christian Schmitt, Bismark Singh:
Quadratic Optimization Models for Balancing Preferential Access and Fairness: Formulations and Optimality Conditions. INFORMS J. Comput. 36(5): 1150-1167 (2024) - [j11]Malena Schmidt, Bismark Singh:
Selectively closing recycling centers in Bavaria: Reforming waste-management policy to reduce disparity. Networks 84(2): 148-160 (2024) - 2023
- [j10]Bismark Singh, Lena Oberfichtner, Sergey Ivliev:
Heuristics for a cash-collection routing problem with a cluster-first route-second approach. Ann. Oper. Res. 322(1): 413-440 (2023) - [c2]Charlotte Ritter, Bismark Singh:
Statistical Performance of Subgradient Step-Size Update Rules in Lagrangian Relaxations of Chance-Constrained Optimization Models. OPTIMA 2023: 357-373 - 2022
- [j9]Bismark Singh, Oliver Rehberg, Theresa Groß, Maximilian Hoffmann, Leander Kotzur, Detlef Stolten:
Budget-cut: introduction to a budget based cutting-plane algorithm for capacity expansion models. Optim. Lett. 16(5): 1373-1391 (2022) - 2021
- [j8]Bismark Singh, Bernard Knueven:
Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system. J. Glob. Optim. 80(4): 965-989 (2021) - [j7]Bismark Singh:
Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs. Optim. Lett. 15(2): 327-336 (2021) - [j6]Bismark Singh:
Correction to: Fairness criteria for allocating scarce resources. Optim. Lett. 15(4): 1505 (2021) - 2020
- [j5]Bismark Singh, Bernard Knueven, Jean-Paul Watson:
Modeling flexible generator operating regions via chance-constrained stochastic unit commitment. Comput. Manag. Sci. 17(2): 309-326 (2020) - [j4]Steffen Rebennack, Oleg A. Prokopyev, Bismark Singh:
Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms. Networks 75(3): 235-258 (2020) - [j3]Bismark Singh:
Fairness criteria for allocating scarce resources. Optim. Lett. 14(6): 1533-1541 (2020)
2010 – 2019
- 2019
- [j2]Bismark Singh, Jean-Paul Watson:
Approximating two-stage chance-constrained programs with classical probability bounds. Optim. Lett. 13(6): 1403-1416 (2019) - [c1]Bismark Singh, David Pozo:
A Guide to Solar Power Forecasting using ARMA Models. ISGT Europe 2019: 1-4 - 2018
- [j1]Bismark Singh, David P. Morton, Surya Santoso:
An adaptive model with joint chance constraints for a hybrid wind-conventional generator system. Comput. Manag. Sci. 15(3-4): 563-582 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-02-26 00:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
