On the public citation graph
Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey
0 signed · 232 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
inferredcites →https://doi.org/10.1002/mcda.1574openalex-snapshot
Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1002/mcda.4020030204openalex-snapshot
Multi‐objective combinatorial optimization problems: A survey
inferredcites →https://doi.org/10.1002/nav.3800290202openalex-snapshot
A combined approach to solve binary multicriteria problems
inferredcites →https://doi.org/10.1007/3-540-54522-0_102openalex-snapshot
Buchberger algorithm and integer programming
inferredcites →https://doi.org/10.1007/3-540-59408-6_57openalex-snapshot
GRIN: An implementation of Gröbner bases for integer programming
inferredcites →https://doi.org/10.1007/978-0-387-25534-7_16openalex-snapshot
Measuring Labor-Efficiency in Post Offices
inferredcites →https://doi.org/10.1007/978-0-387-36797-2openalex-snapshot
Evolutionary Algorithms for Solving Multi-Objective Problems
inferredcites →https://doi.org/10.1007/978-1-4615-5563-6openalex-snapshot
Nonlinear Multiobjective Optimization
inferredcites →https://doi.org/10.1007/978-1-4939-3094-4_18openalex-snapshot
Continuous Multiobjective Programming
inferredcites →https://doi.org/10.1007/978-1-4939-3094-4_19openalex-snapshot
Exact Methods for Multi-Objective Combinatorial Optimisation
inferredcites →https://doi.org/10.1007/978-3-319-07557-0_14openalex-snapshot
The Triangle Splitting Method for Biobjective Mixed Integer Programming
inferredcites →https://doi.org/10.1007/978-3-319-28746-1_6openalex-snapshot
Multiobjective Integer and Mixed-Integer Linear Programming
inferredcites →https://doi.org/10.1007/978-3-319-44953-1_6openalex-snapshot
Multiobjective Optimization by Decision Diagrams
inferredcites →https://doi.org/10.1007/978-3-540-36510-5_1openalex-snapshot
Multiple Objective Combinatorial Optimization — A Tutorial
inferredcites →https://doi.org/10.1007/978-3-540-79159-1openalex-snapshot
Adaptive Scalarization Methods in Multiobjective Optimization
inferredcites →https://doi.org/10.1007/978-3-540-87477-5_8openalex-snapshot
Solving the Multiple Objective Integer Linear Programming Problem
inferredcites →https://doi.org/10.1007/978-3-540-88908-3_2openalex-snapshot
Introduction to Multiobjective Optimization: Interactive Approaches
inferredcites →https://doi.org/10.1007/978-3-642-48782-8_32openalex-snapshot
The Use of Reference Objectives in Multiobjective Optimization
inferredcites →https://doi.org/10.1007/978-3-642-56680-6_22openalex-snapshot
Bounds and Bound Sets for Biobjective Combinatorial Optimization Problems
inferredcites →https://doi.org/10.1007/978-3-642-59132-7_24openalex-snapshot
Multiple Criteria Discrete Dynamic Programming
inferredcites →https://doi.org/10.1007/978-3-642-60667-0_24openalex-snapshot
Multicriteria Integer Programming: An Overview of the Different Algorithmic Approaches
inferredcites →https://doi.org/10.1007/978-3-642-87563-2_5openalex-snapshot
On the Relationship of the Tchebycheff Norm and the Efficient Frontier of Multiple-Criteria Objectives
inferredcites →https://doi.org/10.1007/b101915openalex-snapshot
Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys
inferredcites →https://doi.org/10.1007/bf00932634openalex-snapshot
A survey of multicriteria optimization or the vector maximum problem, part I: 1776?1960
inferredcites →https://doi.org/10.1007/bf00933152openalex-snapshot
Existence of efficient solutions for vector maximization problems
inferredcites →https://doi.org/10.1007/bf00934322openalex-snapshot
Multicriteria dynamic programming with an application to the integer case
inferredcites →https://doi.org/10.1007/bf00934564openalex-snapshot
Scalarizing vector optimization problems
inferredcites →https://doi.org/10.1007/bf00939577openalex-snapshot
Algorithms for nonlinear integer bicriterion problems
inferredcites →https://doi.org/10.1007/bf01074927openalex-snapshot
Finding the set of alternatives in discrete multicriterion problems
inferredcites →https://doi.org/10.1007/bf01584241openalex-snapshot
Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
inferredcites →https://doi.org/10.1007/bf01584332openalex-snapshot
Linear multiple objective programs with zero–one variables
inferredcites →https://doi.org/10.1007/bf01588256openalex-snapshot
Theory and algorithms for linear multiple objective programs with zero–one variables
inferredcites →https://doi.org/10.1007/bf01719738openalex-snapshot
On the completeness and constructiveness of parametric characterizations to vector optimization problems
inferredcites →https://doi.org/10.1007/bf01720321openalex-snapshot
Three algorithms for bicriteria integer linear programs
inferredcites →https://doi.org/10.1007/bf02591870openalex-snapshot
An interactive weighted Tchebycheff procedure for multiple objective programming
inferredcites →https://doi.org/10.1007/s00158-003-0368-6openalex-snapshot
Survey of multi-objective optimization methods for engineering
inferredcites →https://doi.org/10.1007/s00186-017-0618-9openalex-snapshot
Variants of the $$ \varepsilon $$ ε -constraint method for biobjective integer programming problems: application to p-median-cover problems
inferredcites →https://doi.org/10.1007/s002910000046openalex-snapshot
A survey and annotated bibliography of multiobjective combinatorial optimization
inferredcites →https://doi.org/10.1007/s10479-006-0058-zopenalex-snapshot
An improved algorithm for solving biobjective integer programs
inferredcites →https://doi.org/10.1007/s10479-006-0074-zopenalex-snapshot
A discussion of scalarization techniques for multiple objective integer programming
inferredcites →https://doi.org/10.1007/s10479-007-0186-0openalex-snapshot
A survey of recent developments in multiobjective optimization
inferredcites →https://doi.org/10.1007/s10479-019-03317-9openalex-snapshot
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
inferredcites →https://doi.org/10.1007/s10479-019-03422-9openalex-snapshot
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
inferredcites →https://doi.org/10.1007/s10898-012-9955-7openalex-snapshot
Finding all nondominated points of multi-objective integer programs
inferredcites →https://doi.org/10.1007/s10898-014-0205-zopenalex-snapshot
A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
inferredcites →https://doi.org/10.1007/s10898-019-00778-xopenalex-snapshot
An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
inferredcites →https://doi.org/10.1007/s10957-005-5494-4openalex-snapshot
Approximation Methods in Multiobjective Programming
inferredcites →https://doi.org/10.1007/s10957-008-9394-2openalex-snapshot
Improved ε-Constraint Method for Multiobjective Programming
inferredcites →https://doi.org/10.1007/s10957-013-0364-yopenalex-snapshot
Multi-Objective Integer Programming: An Improved Recursive Algorithm
inferredcites →https://doi.org/10.1007/s11081-018-9399-0openalex-snapshot
GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
inferredcites →https://doi.org/10.1007/s11590-011-0279-1openalex-snapshot
A new complexity result on multiobjective linear integer programming using short rational generating functions
inferredcites →https://doi.org/10.1007/s12532-015-0093-3openalex-snapshot
The L-shape search method for triobjective integer programming
inferredcites →https://doi.org/10.1007/s12597-015-0211-zopenalex-snapshot
On efficient solutions of 0-1 multi-objective linear programming problems
inferredcites →https://doi.org/10.1016/0022-247x(68)90201-1openalex-snapshot
Proper efficiency and the theory of vector maximization
inferredcites →https://doi.org/10.1016/0167-6377(92)90064-aopenalex-snapshot
Total unimodularity applications in bi-objective discrete optimization
inferredcites →https://doi.org/10.1016/0305-0548(91)90037-ropenalex-snapshot
Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
inferredcites →https://doi.org/10.1016/0377-2217(82)90182-5openalex-snapshot
An algorithm for the multiple objective integer linear programming problem
inferredcites →https://doi.org/10.1016/0377-2217(83)90157-1openalex-snapshot
Solving zero-one multiple objective programs through implicit enumeration
inferredcites →https://doi.org/10.1016/0377-2217(84)90056-0openalex-snapshot
A branch and bound method for multi-objective boolean problems
inferredcites →https://doi.org/10.1016/0377-2217(86)90048-2openalex-snapshot
On efficient sets in vector maximum problems — A brief survey
inferredcites →https://doi.org/10.1016/0377-2217(86)90093-7openalex-snapshot
An algorithm for the bi-criterion integer programming problem
inferredcites →https://doi.org/10.1016/0377-2217(86)90161-xopenalex-snapshot
Zero—one programming with multiple criteria
inferredcites →https://doi.org/10.1016/0898-1221(88)90188-5openalex-snapshot
Theory and applications of generalized dynamic programming: An overview
inferredcites →https://doi.org/10.1016/j.amc.2005.01.038openalex-snapshot
Multi-criteria branch and bound: A vector maximization algorithm for Mixed 0-1 Multiple Objective Linear Programming
inferredcites →https://doi.org/10.1016/j.amc.2009.03.037openalex-snapshot
Effective implementation of the ε-constraint method in Multi-Objective Mathematical Programming problems
inferredcites →https://doi.org/10.1016/j.amc.2013.03.002openalex-snapshot
An improved version of the augmented ε-constraint method (AUGMECON2) for finding the exact pareto set in multi-objective integer programming problems
inferredcites →https://doi.org/10.1016/j.cor.2005.09.014openalex-snapshot
Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
inferredcites →https://doi.org/10.1016/j.cor.2005.10.003openalex-snapshot
Bound sets for biobjective combinatorial optimization problems
inferredcites →https://doi.org/10.1016/j.cor.2012.02.021openalex-snapshot
An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
inferredcites →https://doi.org/10.1016/j.cor.2012.08.003openalex-snapshot
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case
inferredcites →https://doi.org/10.1016/j.cor.2016.02.006openalex-snapshot
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design
inferredcites →https://doi.org/10.1016/j.cor.2016.03.001openalex-snapshot
An exact algorithm for biobjective mixed integer linear programming problems
inferredcites →https://doi.org/10.1016/j.cor.2016.06.021openalex-snapshot
A box decomposition algorithm to compute the hypervolume indicator
inferredcites →https://doi.org/10.1016/j.cor.2021.105298openalex-snapshot
An exact algorithm for biobjective integer programming problems
inferredcites →https://doi.org/10.1016/j.disopt.2010.03.005openalex-snapshot
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
inferredcites →https://doi.org/10.1016/j.disopt.2016.09.003openalex-snapshot
Fathoming rules for biobjective mixed integer linear programs: Review and extensions
inferredcites →https://doi.org/10.1016/j.disopt.2018.02.001openalex-snapshot
A hybrid approach for biobjective optimization
inferredcites →https://doi.org/10.1016/j.ejor.2006.02.033openalex-snapshot
A review of interactive methods for multiobjective integer and mixed-integer programming
inferredcites →https://doi.org/10.1016/j.ejor.2007.12.014openalex-snapshot
An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits
inferredcites →https://doi.org/10.1016/j.ejor.2008.10.023openalex-snapshot
Multi-objective integer programming: A general approach for generating all non-dominated solutions
inferredcites →https://doi.org/10.1016/j.ejor.2008.12.034openalex-snapshot
K-PPM: A new exact method to solve multi-objective combinatorial optimization problems
inferredcites →https://doi.org/10.1016/j.ejor.2013.08.001openalex-snapshot
A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
inferredcites →https://doi.org/10.1016/j.ejor.2013.09.001openalex-snapshot
A simple augmented ∊-constraint method for multi-objective mathematical integer programming problems
inferredcites →https://doi.org/10.1016/j.ejor.2015.03.031openalex-snapshot
On the representation of the search region in multi-objective optimization
inferredcites →https://doi.org/10.1016/j.ejor.2016.03.035openalex-snapshot
The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs
inferredcites →https://doi.org/10.1016/j.ejor.2016.05.029openalex-snapshot
Efficient computation of the search region in multi-objective optimization
inferredcites →https://doi.org/10.1016/j.ejor.2016.11.020openalex-snapshot
Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
inferredcites →https://doi.org/10.1016/j.ejor.2017.01.032openalex-snapshot
Multi-objective branch and bound
inferredcites →https://doi.org/10.1016/j.ejor.2017.09.026openalex-snapshot
A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
inferredcites →https://doi.org/10.1016/j.ejor.2018.01.026openalex-snapshot
The search-and-remove algorithm for biobjective mixed-integer linear programming problems
inferredcites →https://doi.org/10.1016/j.ejor.2018.05.036openalex-snapshot
Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
inferredcites →https://doi.org/10.1016/j.ejor.2018.10.034openalex-snapshot
Preprocessing and cut generation techniques for multi-objective binary programming
inferredcites →https://doi.org/10.1016/j.ejor.2019.09.032openalex-snapshot
An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets
inferredcites →https://doi.org/10.1016/j.ejor.2019.10.034openalex-snapshot
Branching with hyperplanes in the criterion space: The frontier partitioner algorithm for biobjective integer programming
inferredcites →https://doi.org/10.1016/j.jsc.2005.09.007openalex-snapshot
Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
inferredcites →https://doi.org/10.1016/j.orl.2006.03.019openalex-snapshot
Finding representative systems for discrete bicriterion optimization problems
inferredcites →https://doi.org/10.1016/j.orl.2017.11.011openalex-snapshot
A two-stage approach for bi-objective integer linear programming
inferredcites →https://doi.org/10.1016/j.swevo.2011.03.001openalex-snapshot
Multiobjective evolutionary algorithms: A survey of the state of the art
inferredcites →https://doi.org/10.1016/s0076-5392(08)x6053-9openalex-snapshot
Multiobjective Programming and Planning
inferredcites →https://doi.org/10.1016/s0167-5060(08)70360-1openalex-snapshot
A Survey of Multiple Criteria Integer Programming Methods
inferredcites →https://doi.org/10.1016/s0167-5060(08)70760-xopenalex-snapshot
Integer Linear Programming with Multiple Objectives
inferredcites →https://doi.org/10.1016/s0305-0548(99)00030-1openalex-snapshot
Using trade-off information in decision-making algorithms
inferredcites →https://doi.org/10.1016/s0377-2217(01)00123-0openalex-snapshot
Multi-objective meta-heuristics: An overview of the current state-of-the-art
inferredcites →https://doi.org/10.1016/s0377-2217(03)00255-8openalex-snapshot
A method for finding the set of non-dominated vectors for multiple objective integer linear programs
inferredcites →https://doi.org/10.1016/s0377-2217(96)00407-9openalex-snapshot
A reduction algorithm for integer multiple objective linear programs
inferredcites →https://doi.org/10.1016/s0377-2217(97)00077-5openalex-snapshot
A branch and bound algorithm for mixed zero-one multiple objective linear programming
inferredcites →https://doi.org/10.1017/9781009701587.004openalex-snapshot
An Algorithmic Theory of Lattice Points in Polyhedra
inferredcites →https://doi.org/10.1023/a:1008258310679openalex-snapshot
Two-phases Method and Branch and Bound Procedures to Solve the Bi–objective Knapsack Problem
inferredcites →https://doi.org/10.1051/ro:2003006openalex-snapshot
An Algorithm For Solving Multiple Objective Integer Linear Programming Problem
inferredcites →https://doi.org/10.1057/jors.1978.243openalex-snapshot
A Review of Goal Programming: A Tool for Multiobjective Analysis
inferredcites →https://doi.org/10.1057/jors.1990.97openalex-snapshot
A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
inferredcites →https://doi.org/10.1063/1.5090006openalex-snapshot
Multi-objective mixed integer programming: An objective space algorithm
inferredcites →https://doi.org/10.1080/02331937908842578openalex-snapshot
Bibliographic zur vektoroptimierung (theorie und anwendungen)
inferredcites →https://doi.org/10.1080/03155986.2016.1214448openalex-snapshot
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
inferredcites →https://doi.org/10.1088/1742-6596/1490/1/012061openalex-snapshot
Enhancement of the Improved Recursive Method for Multi-objective Integer Programming Problem
inferredcites →https://doi.org/10.1090/psapm/053/1602363openalex-snapshot
Applications to integer programming
inferredcites →https://doi.org/10.1090/psapm/061/2104733openalex-snapshot
Algebraic recipes for integer programming
inferredcites →https://doi.org/10.1090/s0894-0347-03-00428-4openalex-snapshot
Short rational generating functions for lattice point problems
inferredcites →https://doi.org/10.1109/codit.2014.6996868openalex-snapshot
Solving the Bi-Objective Integer Programming: A DEA methodology
inferredcites →https://doi.org/10.1109/tac.1963.1105511openalex-snapshot
Optimality and non-scalar-valued performance criteria
inferredcites →https://doi.org/10.1109/tsmc.1971.4308298openalex-snapshot
On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
inferredcites →https://doi.org/10.1137/070698051openalex-snapshot
Partial Gröbner Bases for Multiobjective Integer Linear Optimization
inferredcites →https://doi.org/10.1142/s0217595904000096openalex-snapshot
A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM
inferredcites →https://doi.org/10.1145/358923.358929openalex-snapshot
An updated survey of GA-based multiobjective optimization techniques
inferredcites →https://doi.org/10.1186/2251-712x-8-17openalex-snapshot
An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem
inferredcites →https://doi.org/10.1287/ijoc.1070.0260openalex-snapshot
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
inferredcites →https://doi.org/10.1287/ijoc.1080.0277openalex-snapshot
Pareto Optima of Multicriteria Integer Linear Programs
inferredcites →https://doi.org/10.1287/ijoc.1090.0342openalex-snapshot
A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
inferredcites →https://doi.org/10.1287/ijoc.1110.0476openalex-snapshot
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
inferredcites →https://doi.org/10.1287/ijoc.2015.0646openalex-snapshot
A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
inferredcites →https://doi.org/10.1287/ijoc.2015.0648openalex-snapshot
Discrete Optimization with Decision Diagrams
inferredcites →https://doi.org/10.1287/ijoc.2015.0657openalex-snapshot
A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
inferredcites →https://doi.org/10.1287/ijoc.2017.0783openalex-snapshot
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
inferredcites →https://doi.org/10.1287/ijoc.2017.0804openalex-snapshot
Disjunctive Programming for Multiobjective Discrete Optimisation
inferredcites →https://doi.org/10.1287/ijoc.2018.0846openalex-snapshot
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
inferredcites →https://doi.org/10.1287/ijoc.2018.0856openalex-snapshot
Branch-and-Bound for Bi-objective Integer Programming
inferredcites →https://doi.org/10.1287/ijoc.2018.0875openalex-snapshot
Multiobjective Integer Programming: Synergistic Parallel Approaches
inferredcites →https://doi.org/10.1287/ijoc.2019.0887openalex-snapshot
A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
inferredcites →https://doi.org/10.1287/ijoc.2020.0953openalex-snapshot
Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
inferredcites →https://doi.org/10.1287/ijoc.2020.1028openalex-snapshot
Approximation Methods for Multiobjective Optimization Problems: A Survey
inferredcites →https://doi.org/10.1287/mnsc.1050.0413openalex-snapshot
The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
inferredcites →https://doi.org/10.1287/mnsc.1070.0838openalex-snapshot
Multiple Criteria Decision Making, Multiattribute Utility Theory: Recent Accomplishments and What Lies Ahead
inferredcites →https://doi.org/10.1287/mnsc.19.8.936openalex-snapshot
A Class of Solutions for Group Decision Problems
inferredcites →https://doi.org/10.1287/mnsc.2013.1802openalex-snapshot
A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs
inferredcites →https://doi.org/10.1287/mnsc.29.12.1444openalex-snapshot
An Algorithm for Multiobjective Zero-One Linear Programming
inferredcites →https://doi.org/10.1287/mnsc.30.11.1268openalex-snapshot
An Overview of Techniques for Solving Multiobjective Mathematical Programs
inferredcites →https://doi.org/10.1287/mnsc.30.9.1078openalex-snapshot
Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis
inferredcites →https://doi.org/10.1287/moor.19.4.769openalex-snapshot
A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
inferredcites →https://doi.org/10.1287/moor.20.4.864openalex-snapshot
A Geometric Buchberger Algorithm for Integer Programming
inferredcites →https://doi.org/10.1504/ijmor.2012.046690openalex-snapshot
Efficient cuts for generating the non-dominated vectors for Multiple Objective Integer Linear Programming
inferredcites →https://doi.org/10.21914/anziamj.v58i0.11724openalex-snapshot
A parallel approach to bi-objective integer programming
inferredcites →https://doi.org/10.5860/choice.38-3939openalex-snapshot
Logic-based methods for optimization: combining optimization and constraint satisfaction
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ffo2.70012openalex-snapshot
Supporting Scenario‐Based Decision‐Making With Multi‐Objective Optimization
inferred← citeshttps://doi.org/10.1002/mcda.70029openalex-snapshot
Anytime Lexicographic Enumeration of the Pareto Front in Multi‐Objective Combinatorial Optimisation
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_422-1openalex-snapshot
Multi-Objective Optimization and Decision Support Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-60597-0_10openalex-snapshot
Bi-objective Discrete Graphical Model Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-87057-6_4openalex-snapshot
Test Instances for Multiobjective Mixed-Integer Nonlinear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-92575-7_22openalex-snapshot
Risk Management in Multi-objective Portfolio Optimization Under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_8openalex-snapshot
Engineering and Evaluating Multi-objective Pseudo-Boolean Optimizers
inferred← citeshttps://doi.org/10.1007/978-3-032-05048-9_14openalex-snapshot
Multi-Objective Optimization
inferred← citeshttps://doi.org/10.1007/s00170-023-12671-9openalex-snapshot
Research on image segmentation methods based on optimization theory
inferred← citeshttps://doi.org/10.1007/s00186-023-00826-zopenalex-snapshot
A test instance generator for multiobjective mixed-integer optimization
inferred← citeshttps://doi.org/10.1007/s00186-023-00828-xopenalex-snapshot
A hybrid patch decomposition approach to compute an enclosure for multi-objective mixed-integer convex optimization problems
inferred← citeshttps://doi.org/10.1007/s00186-023-00843-yopenalex-snapshot
A fast and robust algorithm for solving biobjective mixed integer programs
inferred← citeshttps://doi.org/10.1007/s00186-023-00847-8openalex-snapshot
An outer approximation algorithm for generating the Edgeworth–Pareto hull of multi-objective mixed-integer linear programming problems
inferred← citeshttps://doi.org/10.1007/s00186-024-00870-3openalex-snapshot
An approximation algorithm for multiobjective mixed-integer convex optimization
inferred← citeshttps://doi.org/10.1007/s00186-024-00871-2openalex-snapshot
On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
inferred← citeshttps://doi.org/10.1007/s00186-024-00879-8openalex-snapshot
Designing sustainable diet plans by solving triobjective integer programs
inferred← citeshttps://doi.org/10.1007/s10107-024-02121-zopenalex-snapshot
On the strength of Lagrangian duality in multiobjective integer programming
inferred← citeshttps://doi.org/10.1007/s10898-024-01440-xopenalex-snapshot
Using dual relaxations in multiobjective mixed-integer convex quadratic programming
inferred← citeshttps://doi.org/10.1007/s10898-025-01586-2openalex-snapshot
Quadratic convex reformulations for multiObjective binary quadratic programming
inferred← citeshttps://doi.org/10.1007/s10957-023-02285-2openalex-snapshot
A Solver for Multiobjective Mixed-Integer Convex and Nonconvex Optimization
inferred← citeshttps://doi.org/10.1007/s10957-024-02481-8openalex-snapshot
The Weighted p-Norm Weight Set Decomposition for Multiobjective Discrete Optimization Problems
inferred← citeshttps://doi.org/10.1007/s11081-024-09944-xopenalex-snapshot
A framework for balancing power grid efficiency and risk with bi-objective stochastic integer optimization
inferred← citeshttps://doi.org/10.1007/s11590-023-02024-6openalex-snapshot
Fair machine learning through constrained stochastic optimization and an $$\epsilon$$-constraint method
inferred← citeshttps://doi.org/10.1007/s12351-024-00820-1openalex-snapshot
A Lagrangian bounding and heuristic principle for bi-objective discrete optimization
inferred← citeshttps://doi.org/10.1007/s12532-025-00299-7openalex-snapshot
An adaptive relaxation-refinement scheme for multi-objective mixed-integer nonconvex optimization
inferred← citeshttps://doi.org/10.1007/s44257-025-00048-zopenalex-snapshot
Optimizing passenger group vehicle assignment in ride sharing systems using greatest common divisor approach
inferred← citeshttps://doi.org/10.1016/j.apenergy.2026.127544openalex-snapshot
Biomass procurement and supplier diversification for energy generation: Optimization models and insights
inferred← citeshttps://doi.org/10.1016/j.cie.2025.110946openalex-snapshot
A novel hybrid approach for designing green robust manufacturing cells
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2023.108176openalex-snapshot
Design of low-carbon multi-energy systems in the SecMOD framework by combining MILP optimization and life-cycle assessment
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106212openalex-snapshot
Optimising makespan and energy consumption in task scheduling for parallel systems
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106397openalex-snapshot
A matheuristic for tri-objective binary integer linear programming
inferred← citeshttps://doi.org/10.1016/j.eprime.2026.201240openalex-snapshot
Operational optimization of distributed energy systems using multi-objective linear Tchebycheff decomposition
inferred← citeshttps://doi.org/10.1016/j.jfoodeng.2024.112411openalex-snapshot
Inbound logistics optimization for fresh oranges with waste management
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102529openalex-snapshot
Integer programming with binary and bounded variables via Gröbner bases with applications to multiobjective integer programming
inferred← citeshttps://doi.org/10.1016/j.ordal.2025.200488openalex-snapshot
Expanding acute stroke care coverage in resource-limited settings: A multi-objective approach based on facility location problems and NSGA-II
inferred← citeshttps://doi.org/10.1016/j.orp.2024.100299openalex-snapshot
Pareto-optimal front generation for the bi-objective JIT scheduling problems with a piecewise linear trade-off between objectives
inferred← citeshttps://doi.org/10.1016/j.trc.2023.104099openalex-snapshot
Trading off costs and service rates in a first-mile ride-sharing service
inferred← citeshttps://doi.org/10.1080/00207543.2022.2118888openalex-snapshot
Balancing-sequencing paced assembly lines: a multi-objective mixed-integer linear case study
inferred← citeshttps://doi.org/10.1080/01605682.2024.2416510openalex-snapshot
Optimizing a linear function over the efficient set of a multiple objective integer quadratic program
inferred← citeshttps://doi.org/10.1109/icdsca67083.2025.11350158openalex-snapshot
Research on Multi-Objective Task Prediction and Scheduling in Dynamic Environment Based on Combination of ARIMA Model and AGA Algorithm
inferred← citeshttps://doi.org/10.1186/s42162-026-00674-1openalex-snapshot
From models to meaning - an autoethnographic path toward a reflexive framework for interpreting human and ethical dimensions in energy system optimization
inferred← citeshttps://doi.org/10.12720/jait.17.4.737-748openalex-snapshot
Enhancing Multi-Objective Preference Analysis (MOPA) for Optimization of Islamic Tourism Planning
inferred← citeshttps://doi.org/10.12737/2219-0767-2024-17-2-32-42openalex-snapshot
Mathematical modeling and implementation of information and calculation tasks «MASKING»
inferred← citeshttps://doi.org/10.12737/2219-0767-2025-117-126openalex-snapshot
Software package for the implementation of information and calculation tasks "MASKING"
inferred← citeshttps://doi.org/10.1287/ijoc.2023.0220openalex-snapshot
Efficiently Constructing Convex Approximation Sets in Multiobjective Optimization Problems
inferred← citeshttps://doi.org/10.1287/ijoc.2024.0798openalex-snapshot
The Parallel Epsilon Algorithm for Triobjective Integer Optimization Problems
inferred← citeshttps://doi.org/10.1590/0101-7438.2023.043.00281853openalex-snapshot
BIOBJECTIVE INTEGER STOCHASTIC OPTIMIZATION OVER THE INTEGER STOCHASTIC EFFICIENT SET
inferred← citeshttps://doi.org/10.1590/0101-7438.2025.045.00290556openalex-snapshot
AN EXACT METHOD TO SOLVE THE MULTI-OBJECTIVE ASSIGNMENT PROBLEM
inferred← citeshttps://doi.org/10.21203/rs.3.rs-6520660/v1openalex-snapshot
Optimizing Taxi-Passenger Group Assignment in Ride-Sharing Systems: A Prime Factorization and Greatest Common Divisor (GCD) Approach
inferred← citeshttps://doi.org/10.21203/rs.3.rs-8008306/v1openalex-snapshot
Optimizing Taxi-Passenger Group Assignment in Ride-Sharing Systems Using Greatest Common Divisor Approach
inferred← citeshttps://doi.org/10.21203/rs.3.rs-9899562/v1openalex-snapshot
Adversarial Instance Generation and Robust Training for Neural Combinatorial Optimization with Multiple Objectives
inferred← citeshttps://doi.org/10.2139/ssrn.6626029openalex-snapshot
Leveraging Large-scale and Long-term Hydropower Regulation to Mitigate Seasonal and Extreme Compound wind-solar-runoff-load fluctuations for power grid balancing
inferred← citeshttps://doi.org/10.2139/ssrn.6668110openalex-snapshot
Leveraging Large-scale and Long-term Hydropower Regulation to Mitigate Seasonal and Extreme Compound wind-solar-runoff-load fluctuations for power grid balancing
inferred← citeshttps://doi.org/10.2139/ssrn.6902329openalex-snapshot
A source-grid integrated optimization framework to mitigate monthly and sustained multi-day energy supply-demand imbalance risks under extreme wind-solar-runoff-load fluctuations
inferred← citeshttps://doi.org/10.23919/csms.2024.0037openalex-snapshot
Systematic Literature Review on Multi-Objective Simulation Optimization
inferred← citeshttps://doi.org/10.24963/ijcai.2023/757openalex-snapshot
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities
inferred← citeshttps://doi.org/10.26686/wgtn.28049429openalex-snapshot
Error Space Search for Combinatorial Optimization
inferred← citeshttps://doi.org/10.32614/cran.package.multiscapeopenalex-snapshot
multiscape: Multi-Action, Multi-Objective Spatial Planning
inferred← citeshttps://doi.org/10.32657/10356/163617openalex-snapshot
Neural combinatorial optimization: from routing to integer programming
inferred← citeshttps://doi.org/10.3390/electronics12204198openalex-snapshot
Comparison of Multi-Object Control Methods Using Multi-Objective Optimization
inferred← citeshttps://doi.org/10.3390/math10071184openalex-snapshot
Optimization of the Cognitive Processes in a Virtual Classroom: A Multi-objective Integer Linear Programming Approach
inferred← citeshttps://doi.org/10.3390/math10244705openalex-snapshot
A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy
inferred← citeshttps://doi.org/10.3390/risks12020023openalex-snapshot
Quadratic Unconstrained Binary Optimization Approach for Incorporating Solvency Capital into Portfolio Optimization
inferred← citeshttps://doi.org/10.3390/su14159179openalex-snapshot
Multi-Objective Optimization of the Organization’s Performance for Sustainable Development
inferred← citeshttps://doi.org/10.3390/su14159718openalex-snapshot
Optimization of Ramp Locations along Freeways: A Dynamic Programming Approach
inferred← citeshttps://doi.org/10.4995/thesis/10251/207134openalex-snapshot
El diseño del aula como facilitador del aprendizaje: el papel de la luz, el color y la dimensión en los procesos cognitivos.
inferred← citeshttps://doi.org/10.5194/hess-28-3871-2024openalex-snapshot
Impacts of science on society and policy in major river basins globally
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.