On the public citation graph

Perspective cuts for a class of convex 0–1 mixed integer programs

https://doi.org/10.1007/s10107-005-0594-3

0 signed · 249 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-02796-7openalex-snapshot

Convex analysis and minimization algorithms

inferredcites →https://doi.org/10.1007/bf01581273openalex-snapshot

A lift-and-project cutting plane algorithm for mixed 0–1 programs

inferredcites →https://doi.org/10.1007/bf02247879openalex-snapshot

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

inferredcites →https://doi.org/10.1007/bf02592064openalex-snapshot

An outer-approximation algorithm for a class of mixed-integer nonlinear programs

inferredcites →https://doi.org/10.1007/s10107-002-0308-zopenalex-snapshot

Convex extensions and envelopes of lower semi-continuous functions

inferredcites →https://doi.org/10.1007/s101070050103openalex-snapshot

A branch-and-cut method for 0-1 mixed convex programming

inferredcites →https://doi.org/10.1007/s101070050106openalex-snapshot

Convex programming for disjunctive convex optimization

inferredcites →https://doi.org/10.1007/s10479-005-3447-9openalex-snapshot

About Lagrangian Methods in Integer Optimization

inferredcites →https://doi.org/10.1016/s0098-1354(96)00346-8openalex-snapshot

A global MINLP optimization algorithm for the synthesis of heat exchanger networks with no stream splits

inferredcites →https://doi.org/10.1023/a:1008217604285openalex-snapshot

A Convex Envelope Formula for Multilinear Functions

inferredcites →https://doi.org/10.1088/1469-7688/1/5/301openalex-snapshot

Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints

inferredcites →https://doi.org/10.1109/pes.2003.1270466openalex-snapshot

Lagrangian heuristics based on disaggregated Bundle for hydrothermal unit commitment

inferredcites →https://doi.org/10.1109/tpwrs.2002.807114openalex-snapshot

Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment

inferredcites →https://doi.org/10.1109/tpwrs.2003.813202openalex-snapshot

Correction to "Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment"

inferredcites →https://doi.org/10.1109/tpwrs.59openalex-snapshot

IEEE Transactions on Power Systems

inferredcites →https://doi.org/10.1137/1033004openalex-snapshot

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

inferredcites →https://doi.org/10.1137/s1052623498342186openalex-snapshot

Generalized Bundle Methods

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4598167openalex-extracted

inferred← citeshttps://doi.org/10.2139/ssrn.975574openalex-extracted

An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0537openalex-snapshot

Disjunctive Inequalities: Applications And Extensions

inferred← citeshttps://doi.org/10.1002/nav.22251openalex-snapshot

A Sparsity‐Driven Solution Method for the Cardinality Constrained Mean‐Variance Portfolio Selection Problem

inferred← citeshttps://doi.org/10.1002/oca.70033openalex-snapshot

A Comparative Study of MINLP and MPVC Formulations for Solving Complex Nonlinear Decision‐Making Problems in Aerospace Applications

inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_3openalex-snapshot

Perspective Reformulation and Applications

inferred← citeshttps://doi.org/10.1007/978-1-4614-1927-3_5openalex-snapshot

Disjunctive Cuts for Nonconvex MINLP

inferred← citeshttps://doi.org/10.1007/978-1-4614-8987-0_1openalex-snapshot

Recent Progress in Modeling Unit Commitment Problems

inferred← citeshttps://doi.org/10.1007/978-3-030-00473-6_48openalex-snapshot

Perspective Cuts for the ACOPF with Generators

inferred← citeshttps://doi.org/10.1007/978-3-030-21803-4_39openalex-snapshot

Gaining or Losing Perspective

inferred← citeshttps://doi.org/10.1007/978-3-030-45771-6_33openalex-snapshot

On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables

inferred← citeshttps://doi.org/10.1007/978-3-030-48439-2_60openalex-snapshot

Exploiting Partial Convexity of Pump Characteristics in Water Network Design

inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_9openalex-snapshot

Handling Separable Non-convexities Using Disjunctive Cuts

inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_722-1openalex-snapshot

Conic Integer Programming

inferred← citeshttps://doi.org/10.1007/978-3-030-57442-0_1openalex-snapshot

Production and Demand Management

inferred← citeshttps://doi.org/10.1007/978-3-030-57442-0_5openalex-snapshot

Production and Demand Management

inferred← citeshttps://doi.org/10.1007/978-3-030-63072-0_26openalex-snapshot

Start-up/Shut-Down MINLP Formulations for the Unit Commitment with Ramp Constraints

inferred← citeshttps://doi.org/10.1007/978-3-030-63072-0_27openalex-snapshot

Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions

inferred← citeshttps://doi.org/10.1007/978-3-030-78354-9openalex-snapshot

Legal uncertainty and autonomous manufacturing processes

inferred← citeshttps://doi.org/10.1007/978-3-030-78354-9_6openalex-snapshot

Strategies for Mastering Uncertainty

inferred← citeshttps://doi.org/10.1007/978-3-031-08623-6_49openalex-snapshot

Optimization of Wear Related Material Costs of a Hydrostatic Transmission System via MINLP

inferred← citeshttps://doi.org/10.1007/978-3-031-47686-0_2openalex-snapshot

Lagrangian Approaches for QoS Scheduling in Computer Networks

inferred← citeshttps://doi.org/10.1007/978-3-031-90095-2_6openalex-snapshot

Delay Constrained Routing: the Multi-flow Single-Path Case

inferred← citeshttps://doi.org/10.1007/978-3-319-23699-5_2openalex-snapshot

Optimization for Power Systems and the Smart Grid

inferred← citeshttps://doi.org/10.1007/978-3-319-28697-6_54openalex-snapshot

Tight Upper Bounds on the Cardinality Constrained Mean-Variance Portfolio Optimization Problem Using Truncated Eigendecomposition

inferred← citeshttps://doi.org/10.1007/978-3-319-33461-5_23openalex-snapshot

Valid Inequalities for Separable Concave Constraints with Indicator Variables

inferred← citeshttps://doi.org/10.1007/978-3-319-53518-0_4openalex-snapshot

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_15openalex-snapshot

Nonlinear Integer Programming

inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_1openalex-snapshot

Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables

inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_25openalex-snapshot

The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron

inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_3openalex-snapshot

Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-36062-6_18openalex-snapshot

An Algorithm for Two-Stage Stochastic Quadratic Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-36062-6_51openalex-snapshot

Solving Electric Market Quadratic Problems by Branch and Fix Coordination Methods

inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_15openalex-snapshot

On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators

inferred← citeshttps://doi.org/10.1007/978-3-642-36694-9_26openalex-snapshot

Facial Structure and Representation of Integer Hulls of Convex Sets

inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_16openalex-snapshot

On Perspective Functions and Vanishing Constraints in Mixed-Integer Nonlinear Optimal Control

inferred← citeshttps://doi.org/10.1007/978-981-99-0063-3_3openalex-snapshot

A Comparison Study of Mixed-Integer Formulations for Hydro-Thermal SCUC Problem

inferred← citeshttps://doi.org/10.1007/978-981-99-5491-9_14openalex-snapshot

Lagrangian Methods and Dynamic Programming-Based MIP Formulations for the Unit Commitment Problem

inferred← citeshttps://doi.org/10.1007/s10013-018-0313-zopenalex-snapshot

Computational Approaches for Mixed Integer Optimal Control Problems with Indicator Constraints

inferred← citeshttps://doi.org/10.1007/s10107-010-0360-zopenalex-snapshot

Perspective reformulations of mixed integer nonlinear programs with indicator variables

inferred← citeshttps://doi.org/10.1007/s10107-010-0381-7openalex-snapshot

Extending the QCR method to general mixed-integer programs

inferred← citeshttps://doi.org/10.1007/s10107-010-0398-yopenalex-snapshot

Demand allocation with latency cost functions

inferred← citeshttps://doi.org/10.1007/s10107-011-0496-5openalex-snapshot

Convex envelopes generated from finitely many compact convex sets

inferred← citeshttps://doi.org/10.1007/s10107-014-0812-yopenalex-snapshot

Modified orbital branching for structured symmetry with an application to unit commitment

inferred← citeshttps://doi.org/10.1007/s10107-015-0891-4openalex-snapshot

On mathematical programming with indicator constraints

inferred← citeshttps://doi.org/10.1007/s10107-018-1301-5openalex-snapshot

Strong formulations for quadratic optimization with M-matrices and indicator variables

inferred← citeshttps://doi.org/10.1007/s10107-020-01508-yopenalex-snapshot

Strong formulations for conic quadratic optimization with indicator variables

inferred← citeshttps://doi.org/10.1007/s10107-020-01519-9openalex-snapshot

Bi-perspective functions for mixed-integer fractional programs with indicator variables

inferred← citeshttps://doi.org/10.1007/s10107-021-01671-wopenalex-snapshot

Quadratic optimization with switching variables: the convex hull for $$n=2$$

inferred← citeshttps://doi.org/10.1007/s10107-021-01712-4openalex-snapshot

Sparse regression at scale: branch-and-bound rooted in first-order optimization

inferred← citeshttps://doi.org/10.1007/s10107-021-01734-yopenalex-snapshot

Ideal formulations for constrained convex optimization problems with indicator variables

inferred← citeshttps://doi.org/10.1007/s10107-022-01845-0openalex-snapshot

A graph-based decomposition method for convex quadratic optimization with indicators

inferred← citeshttps://doi.org/10.1007/s10107-022-01908-2openalex-snapshot

Supermodularity and valid inequalities for quadratic optimization with indicators

inferred← citeshttps://doi.org/10.1007/s10107-023-01924-wopenalex-snapshot

$$\mathbf {2\times 2}$$-Convexifications for convex quadratic optimization with indicator variables

inferred← citeshttps://doi.org/10.1007/s10107-023-01933-9openalex-snapshot

A new perspective on low-rank optimization

inferred← citeshttps://doi.org/10.1007/s10107-023-01982-0openalex-snapshot

On the convex hull of convex quadratic optimization problems with indicators

inferred← citeshttps://doi.org/10.1007/s10107-023-02019-2openalex-snapshot

Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables

inferred← citeshttps://doi.org/10.1007/s10107-023-02047-yopenalex-snapshot

Constrained optimization of rank-one functions with indicator variables

inferred← citeshttps://doi.org/10.1007/s10107-024-02173-1openalex-snapshot

Explicit convex hull description of bivariate quadratic sets with indicator variables

inferred← citeshttps://doi.org/10.1007/s10107-025-02272-7openalex-snapshot

Polyhedral analysis of quadratic optimization problems with Stieltjes matrices and indicators

inferred← citeshttps://doi.org/10.1007/s10287-014-0210-1openalex-snapshot

Linear vs. quadratic portfolio selection models with hard real-world constraints

inferred← citeshttps://doi.org/10.1007/s10288-010-0118-8openalex-snapshot

Application-oriented mixed integer non-linear programming

inferred← citeshttps://doi.org/10.1007/s10288-014-0279-yopenalex-snapshot

Large-scale Unit Commitment under uncertainty

inferred← citeshttps://doi.org/10.1007/s10288-018-0372-8openalex-snapshot

The multiplicative weights update algorithm for mixed integer nonlinear programming: theory, applications, and limitations

inferred← citeshttps://doi.org/10.1007/s10288-020-00459-6openalex-snapshot

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective

inferred← citeshttps://doi.org/10.1007/s10479-012-1165-7openalex-snapshot

A new method for mean-variance portfolio optimization with cardinality constraints

inferred← citeshttps://doi.org/10.1007/s10479-018-3003-zopenalex-snapshot

Large-scale unit commitment under uncertainty: an updated literature survey

inferred← citeshttps://doi.org/10.1007/s10589-011-9424-0openalex-snapshot

Mixed-integer nonlinear programs featuring “on/off” constraints

inferred← citeshttps://doi.org/10.1007/s10589-012-9474-yopenalex-snapshot

An efficient compact quadratic convex reformulation for general integer quadratic programs

inferred← citeshttps://doi.org/10.1007/s10589-013-9582-3openalex-snapshot

Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach

inferred← citeshttps://doi.org/10.1007/s10589-015-9787-8openalex-snapshot

Approximated perspective relaxations: a project and lift approach

inferred← citeshttps://doi.org/10.1007/s10589-017-9914-9openalex-snapshot

An exact algorithm for a resource allocation problem in mobile wireless communications

inferred← citeshttps://doi.org/10.1007/s10589-018-0052-9openalex-snapshot

An iterative method for solving a bi-objective constrained portfolio optimization problem

inferred← citeshttps://doi.org/10.1007/s10589-020-00176-0openalex-snapshot

A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function

inferred← citeshttps://doi.org/10.1007/s10589-024-00557-9openalex-snapshot

Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones

inferred← citeshttps://doi.org/10.1007/s10878-012-9560-1openalex-snapshot

A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation

inferred← citeshttps://doi.org/10.1007/s10898-012-9842-2openalex-snapshot

Convex relaxations and MIQCQP reformulations for a class of cardinality-constrained portfolio selection problems

inferred← citeshttps://doi.org/10.1007/s10898-021-01022-1openalex-snapshot

Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems

inferred← citeshttps://doi.org/10.1007/s10898-021-01055-6openalex-snapshot

Gaining or losing perspective

inferred← citeshttps://doi.org/10.1007/s10898-022-01184-6openalex-snapshot

Compact mixed-integer programming formulations in quadratic optimization

inferred← citeshttps://doi.org/10.1007/s10898-023-01345-1openalex-snapshot

Global optimization of mixed-integer nonlinear programs with SCIP 8

inferred← citeshttps://doi.org/10.1007/s10898-024-01424-xopenalex-snapshot

A reformulation-enumeration MINLP algorithm for gas network design

inferred← citeshttps://doi.org/10.1007/s10898-025-01527-zopenalex-snapshot

Exact continuous relaxations of $$\ell _0$$-regularized criteria with non-quadratic data terms

inferred← citeshttps://doi.org/10.1007/s10957-014-0624-5openalex-snapshot

Delay-Constrained Shortest Paths: Approximation Algorithms and Second-Order Cone Models

inferred← citeshttps://doi.org/10.1007/s10957-022-02144-6openalex-snapshot

Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions

inferred← citeshttps://doi.org/10.1007/s11075-019-00705-xopenalex-snapshot

An augmented Lagrangian proximal alternating method for sparse discrete optimization problems

inferred← citeshttps://doi.org/10.1007/s11081-018-9411-8openalex-snapshot

A review and comparison of solvers for convex MINLP

inferred← citeshttps://doi.org/10.1007/s11081-020-09536-5openalex-snapshot

Inversion of convection–diffusion equation with discrete sources

inferred← citeshttps://doi.org/10.1007/s11081-020-09551-6openalex-snapshot

A disjunctive cut strengthening technique for convex MINLP

inferred← citeshttps://doi.org/10.1007/s11401-014-0826-zopenalex-snapshot

A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization

inferred← citeshttps://doi.org/10.1007/s11590-018-1360-9openalex-snapshot

Strengthening the sequential convex MINLP technique by perspective reformulations

inferred← citeshttps://doi.org/10.1007/s11590-026-02319-4openalex-snapshot

On tackling non-linear charging functions in the electric vehicle routing problem

inferred← citeshttps://doi.org/10.1007/s11750-011-0240-6openalex-snapshot

A new optimal electricity market bid model solved through perspective cuts

inferred← citeshttps://doi.org/10.1007/s11750-016-0413-4openalex-snapshot

Regularized optimization methods for convex MINLP problems

inferred← citeshttps://doi.org/10.1007/s12532-016-0113-yopenalex-snapshot

Extended formulations in mixed integer conic quadratic programming

inferred← citeshttps://doi.org/10.1007/s12532-017-0118-1openalex-snapshot

Lift-and-project cuts for convex mixed integer nonlinear programs

inferred← citeshttps://doi.org/10.1007/s12532-018-0147-4openalex-snapshot

QPLIB: a library of quadratic programming instances

inferred← citeshttps://doi.org/10.1007/s12532-020-00196-1openalex-snapshot

Minotaur: a mixed-integer nonlinear optimization toolkit

inferred← citeshttps://doi.org/10.1007/s12532-023-00246-4openalex-snapshot

A computational study of perspective cuts

inferred← citeshttps://doi.org/10.1007/s12667-015-0189-xopenalex-snapshot

An overview on mathematical programming approaches for the deterministic unit commitment problem in hydro valleys

inferred← citeshttps://doi.org/10.1007/s12667-016-0212-xopenalex-snapshot

Discrete state-space model to solve the unit commitment and economic dispatch problems

inferred← citeshttps://doi.org/10.1007/s13675-016-0069-8openalex-snapshot

A multiplicative weights update algorithm for MINLP

inferred← citeshttps://doi.org/10.1007/s40305-013-0004-0openalex-snapshot

Recent Advances in Mathematical Programming with Semi-continuous Variables and Cardinality Constraint

inferred← citeshttps://doi.org/10.1016/b978-0-443-15274-0.50532-1openalex-snapshot

Stochastic Optimization of Agrochemical Supply Chains with Risk Management

inferred← citeshttps://doi.org/10.1016/j.asoc.2025.113058openalex-snapshot

A memetic method for solving portfolio optimization problem under cardinality, quantity, and pre-assignment constraints

inferred← citeshttps://doi.org/10.1016/j.cie.2012.02.013openalex-snapshot

Network reduction in the Transmission-Constrained Unit Commitment problem

inferred← citeshttps://doi.org/10.1016/j.cie.2016.09.019openalex-snapshot

Comparison of the formulations for a hub-and-spoke network design problem under congestion

inferred← citeshttps://doi.org/10.1016/j.cie.2020.106986openalex-snapshot

Quadratic convex reformulations for the portfolio selection problem with Value-at-Risk constraint

inferred← citeshttps://doi.org/10.1016/j.comcom.2016.09.006openalex-snapshot

QoS routing with worst-case delay constraints: Models, algorithms and performance analysis

inferred← citeshttps://doi.org/10.1016/j.cor.2016.12.009openalex-snapshot

Delay-constrained routing problems: Accurate scheduling models and admission control

inferred← citeshttps://doi.org/10.1016/j.cor.2020.104975openalex-snapshot

Using ℓ -norms for fairness in combinatorial optimisation

inferred← citeshttps://doi.org/10.1016/j.disopt.2016.04.008openalex-snapshot

Quadratic cone cutting surfaces for quadratic programs with on–off constraints

inferred← citeshttps://doi.org/10.1016/j.disopt.2021.100661openalex-snapshot

Valid inequalities for quadratic optimisation with domain constraints

inferred← citeshttps://doi.org/10.1016/j.egyr.2022.10.301openalex-snapshot

Faster identification of redundant security constraints in SCUC

inferred← citeshttps://doi.org/10.1016/j.ejor.2012.03.006openalex-snapshot

Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs

inferred← citeshttps://doi.org/10.1016/j.ejor.2020.11.048openalex-snapshot

A fast exact method for the capacitated facility location problem with differentiable convex production costs

inferred← citeshttps://doi.org/10.1016/j.ejor.2024.08.030openalex-snapshot

End-to-end, decision-based, cardinality-constrained portfolio optimization

inferred← citeshttps://doi.org/10.1016/j.ejor.2025.07.016openalex-snapshot

50 years of mixed-integer nonlinear and disjunctive programming

inferred← citeshttps://doi.org/10.1016/j.ejor.2025.08.041openalex-snapshot

Benders decomposition for congested partial set covering location with uncertain demand

inferred← citeshttps://doi.org/10.1016/j.endm.2010.05.146openalex-snapshot

Mixed Integer NonLinear Programs featuring “On/Off” constraints: convex analysis and applications

inferred← citeshttps://doi.org/10.1016/j.hcc.2022.100097openalex-snapshot

A comparative study of heuristic methods for cardinality constrained portfolio optimization

inferred← citeshttps://doi.org/10.1016/j.ijepes.2007.10.003openalex-snapshot

Solving unit commitment problems with general ramp constraints

inferred← citeshttps://doi.org/10.1016/j.ijepes.2010.12.013openalex-snapshot

Sequential Lagrangian-MILP approaches for Unit Commitment problems

inferred← citeshttps://doi.org/10.1016/j.ijepes.2014.11.025openalex-snapshot

An improved priority list and neighborhood search method for unit commitment

inferred← citeshttps://doi.org/10.1016/j.ijepes.2020.105996openalex-snapshot

A quick center-point algorithm for unit commitment with carbon emission trading

inferred← citeshttps://doi.org/10.1016/j.orl.2006.03.008openalex-snapshot

SDP diagonalizations and perspective cuts for a class of nonseparable MIQP

inferred← citeshttps://doi.org/10.1016/j.orl.2008.12.009openalex-snapshot

A strong conic quadratic reformulation for machine-job assignment with controllable processing times

inferred← citeshttps://doi.org/10.1016/j.orl.2009.02.003openalex-snapshot

A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes

inferred← citeshttps://doi.org/10.1016/j.orl.2010.05.010openalex-snapshot

On interval-subgradient and no-good cuts

inferred← citeshttps://doi.org/10.1016/j.orl.2017.08.001openalex-snapshot

Improving the Approximated Projected Perspective Reformulation by dual information

inferred← citeshttps://doi.org/10.1016/j.orl.2022.01.007openalex-snapshot

The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables

inferred← citeshttps://doi.org/10.1016/j.orl.2022.01.019openalex-snapshot

An extended formulation for two-stage stochastic unit commitment with reserves

inferred← citeshttps://doi.org/10.1016/j.orl.2023.107059openalex-snapshot

A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation

inferred← citeshttps://doi.org/10.1016/j.orl.2023.11.003openalex-snapshot

Comparing perspective reformulations for piecewise-convex optimization

inferred← citeshttps://doi.org/10.1016/j.qref.2022.07.007openalex-snapshot

Mean--variance portfolio selection problem: Asset reduction via nondominated sorting

inferred← citeshttps://doi.org/10.1016/j.rineng.2023.101191openalex-snapshot

Sensitivity analysis of the unit commitment problem to guide data acquisition investments in a small island developing state: A case study

inferred← citeshttps://doi.org/10.1017/s0962492913000032openalex-snapshot

Mixed-integer nonlinear optimization

inferred← citeshttps://doi.org/10.1049/iet-gtd.2012.0218openalex-snapshot

Tight polyhedral approximation for mixed-integer linear programming unit commitment formulations

inferred← citeshttps://doi.org/10.1057/s41599-022-01327-wopenalex-snapshot

The impact of regulation-based constraints on portfolio selection: The Spanish case

inferred← citeshttps://doi.org/10.1063/1.5089984openalex-snapshot

Perspective envelopes for bilinear functions

inferred← citeshttps://doi.org/10.1080/10556788.2016.1196206openalex-snapshot

Splitting augmented Lagrangian method for optimization problems with a cardinality constraint and semicontinuous variables

inferred← citeshttps://doi.org/10.1080/10556788.2016.1204299openalex-snapshot

A penalty PALM method for sparse portfolio selection problems

inferred← citeshttps://doi.org/10.1080/10556788.2021.1977809openalex-snapshot

Global optimization for sparse solution of least squares problems

inferred← citeshttps://doi.org/10.1093/comjnl/bxu053openalex-snapshot

Optimal Joint Path Computation and Rate Allocation for Real-time Traffic

inferred← citeshttps://doi.org/10.1109/caibda70336.2026.11621715openalex-snapshot

Symmetry Breaking for Parallel Machine Scheduling with Compressing Processing Times

inferred← citeshttps://doi.org/10.1109/ccece.2010.5575170openalex-snapshot

Tight mixed integer linear programming formulations for generator Self-Scheduling

inferred← citeshttps://doi.org/10.1109/compeng.2014.6994685openalex-snapshot

Tight Unit Commitment models with Optimal Transmission Switching: Connecting the dots with perturbed objective function

inferred← citeshttps://doi.org/10.1109/eeeic/icpseurope64998.2025.11169291openalex-snapshot

Enhancing Energy System Modelling with Advanced Mathematical Decomposition Techniques: Feasibility of Coupling Sms++ and Pypsa

inferred← citeshttps://doi.org/10.1109/eem.2011.5953017openalex-snapshot

Efficient solution of optimal multimarket electricity bid models

inferred← citeshttps://doi.org/10.1109/icpre.2017.8390553openalex-snapshot

The simulation analyses of Jinnan ± 800kV UHVDC transmission control system based on PSCAD/EMTDC

inferred← citeshttps://doi.org/10.1109/lcsys.2025.3585953openalex-snapshot

Sharp Hybrid Zonotopes: Set Operations and the Reformulation-Linearization Technique

inferred← citeshttps://doi.org/10.1109/lsp.2022.3195429openalex-snapshot

Correlation-Aware Joint Support Recovery With Separation Prior

inferred← citeshttps://doi.org/10.1109/tpwrs.2008.2004744openalex-snapshot

Tighter Approximated MILP Formulations for Unit Commitment Problems

inferred← citeshttps://doi.org/10.1109/tpwrs.2011.2162008openalex-snapshot

Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem

inferred← citeshttps://doi.org/10.1109/tpwrs.2014.2326920openalex-snapshot

Tight Relaxation Method for Unit Commitment Problem Using Reformulation and Lift-and-Project

inferred← citeshttps://doi.org/10.1109/tpwrs.2017.2783850openalex-snapshot

Exploiting Identical Generators in Unit Commitment

inferred← citeshttps://doi.org/10.1109/tpwrs.2023.3250489openalex-snapshot

Mixed Integer Optimization of the Flow Pattern for Stochastic Feeder Reconfiguration

inferred← citeshttps://doi.org/10.1109/tpwrs.2023.3317287openalex-snapshot

Perspective Reformulations of the Two-Level Service Restoration Problem

inferred← citeshttps://doi.org/10.1109/tpwrs.2024.3442088openalex-snapshot

Outer Approximation Method for Discrete AC Optimal Power Flow

inferred← citeshttps://doi.org/10.1109/tste.2017.2781908openalex-snapshot

Comparing Spatial and Scenario Decomposition for Stochastic Hydrothermal Unit Commitment Problems

inferred← citeshttps://doi.org/10.1111/2041-210x.12564openalex-snapshot

Optimizing ecological survey effort over space and time

inferred← citeshttps://doi.org/10.1111/biom.13553openalex-snapshot

Simultaneous feature selection and outlier detection with optimality guarantees

inferred← citeshttps://doi.org/10.1111/itor.12541openalex-snapshot

Complex portfolio selection via convex mixed‐integer quadratic programming: a survey

inferred← citeshttps://doi.org/10.1111/itor.13121openalex-snapshot

Expected mean return—standard deviation efficient frontier approximation with low‐cardinality portfolios in the presence of the risk‐free asset

inferred← citeshttps://doi.org/10.1137/120878963openalex-snapshot

Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets

inferred← citeshttps://doi.org/10.1137/15m1012232openalex-snapshot

Quadratic Convex Reformulations for Semicontinuous Quadratic Programming

inferred← citeshttps://doi.org/10.1137/19m1245414openalex-snapshot

Scalable Algorithms for the Sparse Ridge Regression

inferred← citeshttps://doi.org/10.1137/19m1306233openalex-snapshot

Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization

inferred← citeshttps://doi.org/10.1137/20m1346778openalex-snapshot

A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints

inferred← citeshttps://doi.org/10.1137/21m1398677openalex-snapshot

Approximation Bounds for Sparse Programs

inferred← citeshttps://doi.org/10.1137/21m142770xopenalex-snapshot

Cardinality Minimization, Constraints, and Regularization: A Survey

inferred← citeshttps://doi.org/10.1137/22m1523790openalex-snapshot

Shortest Paths in Graphs of Convex Sets

inferred← citeshttps://doi.org/10.1137/22m1542313openalex-snapshot

Deep Neural Networks Pruning via the Structured Perspective Regularization

inferred← citeshttps://doi.org/10.1137/23m1549444openalex-snapshot

Subset Selection and the Cone of Factor-Width- k Matrices

inferred← citeshttps://doi.org/10.1214/21-aos2155openalex-snapshot

Grouped variable selection with discrete optimization: Computational and statistical perspectives

inferred← citeshttps://doi.org/10.1214/25-aos2551openalex-snapshot

Sparse PCA: A new scalable estimator based on integer programming

inferred← citeshttps://doi.org/10.1287/educ.2021.0232openalex-snapshot

Exactness in Semidefinite Progam Relaxations of Quadratically Constrained Quadratic Programs: Theory and Applications

inferred← citeshttps://doi.org/10.1287/educ.2025.0292openalex-snapshot

Responsible Machine Learning via Mixed-Integer Optimization

inferred← citeshttps://doi.org/10.1287/ijoc.1120.0533openalex-snapshot

Construction of Risk-Averse Enhanced Index Funds

inferred← citeshttps://doi.org/10.1287/ijoc.1120.0545openalex-snapshot

An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs

inferred← citeshttps://doi.org/10.1287/ijoc.2014.0592openalex-snapshot

Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach

inferred← citeshttps://doi.org/10.1287/ijoc.2019.0900openalex-snapshot

Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching

inferred← citeshttps://doi.org/10.1287/ijoc.2019.0925openalex-snapshot

Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs

inferred← citeshttps://doi.org/10.1287/ijoc.2019.0944openalex-snapshot

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

inferred← citeshttps://doi.org/10.1287/ijoc.2021.1127openalex-snapshot

A Scalable Algorithm for Sparse Portfolio Selection

inferred← citeshttps://doi.org/10.1287/ijoc.2022.1211openalex-snapshot

An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems

inferred← citeshttps://doi.org/10.1287/ijoc.2025.1215openalex-snapshot

Outlier Detection in Regression: Conic Quadratic Formulations

inferred← citeshttps://doi.org/10.1287/mnsc.2016.2461openalex-snapshot

Redesigning Benders Decomposition for Large-Scale Facility Location

inferred← citeshttps://doi.org/10.1287/moor.1110.0488openalex-snapshot

The Chvátal-Gomory Closure of a Strictly Convex Body

inferred← citeshttps://doi.org/10.1287/moor.2018.0969openalex-snapshot

Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs

inferred← citeshttps://doi.org/10.1287/moor.2021.0281openalex-snapshot

Compact Extended Formulations for Low-Rank Functions with Indicator Variables

inferred← citeshttps://doi.org/10.1287/moor.2022.1254openalex-snapshot

Necessary and Sufficient Conditions for Rank-One-Generated Cones

inferred← citeshttps://doi.org/10.1287/opre.1080.0599openalex-snapshot

An Exact Solution Approach for Integer Constrained Portfolio Optimization Problems Under Stochastic Constraints

inferred← citeshttps://doi.org/10.1287/opre.1110.0930openalex-snapshot

Projected Perspective Reformulations with Applications in Design Problems

inferred← citeshttps://doi.org/10.1287/opre.2014.1293openalex-snapshot

PERSPECTIVE REFORMULATIONS OF THE CTA PROBLEM WITH L2 DISTANCES

inferred← citeshttps://doi.org/10.1287/opre.2023.2435openalex-snapshot

New Mixed-Integer Nonlinear Programming Formulations for the Unit Commitment Problems with Ramping Constraints

inferred← citeshttps://doi.org/10.1287/trsc.2013.0486openalex-snapshot

Single-Car Routing in Rail Freight Transport

inferred← citeshttps://doi.org/10.1287/trsc.2024.0657openalex-snapshot

Intermodal Hub Network Design with Probabilistic Service-Level Constraints

inferred← citeshttps://doi.org/10.17635/lancaster/thesis/474openalex-snapshot

Optimal resource allocation In base stations for mobile wireless communications

inferred← citeshttps://doi.org/10.17877/de290r-16296openalex-snapshot

Continuous optimization methods for convex mixed-integer nonlinear programming

showing the first 200 of 232 · page through all 232

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.