Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Recent Developments in Discrete Convex Analysis - MaRDI portal

Recent Developments in Discrete Convex Analysis (Q2971611)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Recent Developments in Discrete Convex Analysis	scientific article

Statements

scholarly article

0 references

Recent Developments in Discrete Convex Analysis (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-540-76796-1_11

0 references

0 references

Research Trends in Combinatorial Optimization

0 references

publication date

7 April 2017

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-76796-1_11

0 references

0 references

The assignment game. I: The core

0 references

A weighted matroid intersection algorithm

0 references

Submodular functions and optimization.

0 references

Valuated matroids: A new look at the greedy algorithm

0 references

Stable bundles, representation theory and Hermitian operators

0 references

The tropical Grassmannian

0 references

Combinatorial optimization. Theory and algorithms.

0 references

Submodular set functions, matroids and the greedy algorithm: Tight worst- case bounds and some generalizations of the Rado-Edmonds theorem

0 references

Pipage rounding: a new method of constructing algorithms with proven performance guarantee

0 references

0 references

Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra

0 references

Valuated Matroid Intersection II: Algorithms

0 references

Valuated Matroid Intersection I: Optimality Criteria

0 references

Discrete Convex Analysis

0 references

Extremal Splittings of Point Processes

0 references

Complexity of Matroid Property Algorithms

0 references

Conjugate Scaling Algorithm for Fenchel-Type Duality in Discrete Convex Optimization

0 references

On Steepest Descent Algorithms for Discrete Convex Functions

0 references

An analysis of approximations for maximizing submodular set functions—I

0 references

An Algorithm for Submodular Functions on Graphs

0 references

The honeycomb model of 𝐺𝐿_{𝑛}(ℂ) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone

0 references

\(T\)-theory: An overview

0 references

Submodular flow problem with a nonseparable cost function

0 references

M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem

0 references

\(M\)-convex functions and tree metrics

0 references

On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application

0 references

Operations on M‐Convex Functions on Jump Systems

0 references

Polynomial-Time Algorithms for Linear and Convex Optimization on Jump Systems

0 references

M-Convex Function on Generalized Polymatroid

0 references

Extension of M-convexity and L-convexity to polyhedral convex functions

0 references

Multimodularity, Convexity, and Optimization Properties

0 references

On circuit valuation of matroids

0 references

Matroid matching and some applications

0 references

A Fixed-Point Approach to Stable Matchings and Some Applications

0 references

Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions

0 references

Note on Multimodularity and L-Convexity

0 references

A labor market with heterogeneous firms and workers

0 references

A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis

0 references

A note on maximizing a submodular set function subject to a knapsack constraint

0 references

A geometric study of the split decomposition

0 references

Eigenvalues, invariant factors, highest weights, and Schubert calculus

0 references

A discrete fixed point theorem and its applications.

0 references

Applications of discrete convex analysis to mathematical economics

0 references

Discrete fixed point theorem reconsidered

0 references

0 references

Submodular functions and electrical networks

0 references

Combinatorial auctions with decreasing marginal utilities

0 references

College Admissions and the Stability of Marriage

0 references

Fenchel-type duality for matroid valuations

0 references

Discrete convex analysis

0 references

0 references

Conjugacy relationship between M-convex and L-convex functions in continuous variables

0 references

Notes on L-/M-convex functions and the separation theorems

0 references

A canonical decomposition theory for metrics on a finite set

0 references

Valuated matroids

0 references

Proximity theorems of discrete convex functions

0 references

Coordinatewise domain scaling algorithm for M-convex function minimization

0 references

A capacity scaling algorithm for M-convex submodular flow

0 references

Solving discrete zero point problems

0 references

Submodular function minimization

0 references

Convexity and Steinitz's exchange property

0 references

Fast scaling algorithms for M-convex function minimization with application to the resource allocation problem.

0 references

Induction of M-convex functions by linking systems

0 references

Stable matching in a common generalization of the marriage and assignment models

0 references

0 references

Concave cocirculations in a triangular grid

0 references

Discrete-event control of stochastic networks: multimodularity and regularity.

0 references

Convex Analysis

0 references

Theory of Matroids

0 references

0 references

0 references

0 references

Dirichlet forms and symmetric Markov processes

0 references

Geometry of cuts and metrics

0 references

0 references

Matrices and matroids for systems analysis

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

0 references

The Buneman index via polyhedral split decomposition

0 references

New algorithms for convex cost tension problem with application to computer vision

0 references

Even factors, jump systems, and discrete convexity

0 references

On the Structure of Lost-Sales Inventory Models

0 references

ON THE PIPAGE ROUNDING ALGORITHM FOR SUBMODULAR FUNCTION MAXIMIZATION — A VIEW FROM DISCRETE CONVEX ANALYSIS

0 references

0 references

A Simplicial Approach for Discrete Fixed Point Theorems

0 references

Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

0 references

Tropical Linear Spaces

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2971611

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2971611&oldid=36314827"